[ Started: 2023-03-17 23:31:49 CET ] [ dorothea v1.7.2 for BioC-3.17 from https://github.com/saezlab/dorothea@master ] [1] "Libraries: " "/home/omnipath/local/R/4.3-3.17" [3] "/home/omnipath/local/R/4.3" "/opt/R-devel/lib/R/library" Bioconductor version 3.17 (BiocManager 1.30.20), R Under development (unstable) (2023-03-16 r83996) Bioconductor version 3.17 (BiocManager 1.30.20), R Under development (unstable) (2023-03-16 r83996) Installing package(s) 'BiocCheck' also installing the dependencies ‘RBGL’, ‘RUnit’, ‘biocViews’, ‘stringdist’ trying URL 'https://bioconductor.org/packages/3.17/bioc/src/contrib/RBGL_1.75.0.tar.gz' Content type 'application/x-gzip' length 2256052 bytes (2.2 MB) ================================================== downloaded 2.2 MB trying URL 'https://cloud.r-project.org/src/contrib/RUnit_0.4.32.tar.gz' Content type 'application/x-gzip' length 337142 bytes (329 KB) ================================================== downloaded 329 KB trying URL 'https://bioconductor.org/packages/3.17/bioc/src/contrib/biocViews_1.67.3.tar.gz' Content type 'application/x-gzip' length 518238 bytes (506 KB) ================================================== downloaded 506 KB trying URL 'https://cloud.r-project.org/src/contrib/stringdist_0.9.10.tar.gz' Content type 'application/x-gzip' length 862221 bytes (842 KB) ================================================== downloaded 842 KB trying URL 'https://bioconductor.org/packages/3.17/bioc/src/contrib/BiocCheck_1.35.13.tar.gz' Content type 'application/x-gzip' length 4373688 bytes (4.2 MB) ================================================== downloaded 4.2 MB * installing *source* package ‘RBGL’ ... ** using staged installation ** libs using C++ compiler: ‘g++ (Ubuntu 11.3.0-1ubuntu1~22.04) 11.3.0’ g++ -std=gnu++17 -I"/opt/R-devel/lib/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.17/BH/include' -I/usr/local/include -fpic -g -O2 -c bbc.cpp -o bbc.o In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from bbc.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:250:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 250 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from bbc.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:507:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 507 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from bbc.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:520:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 520 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from bbc.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:603:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 603 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from bbc.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:612:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 612 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from bbc.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:614:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 614 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from bbc.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/scoped_ptr.hpp:74:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 74 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from bbc.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = double&; typename std::iterator_traits< >::value_type = double]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = double&; typename std::iterator_traits< >::value_type = double]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = double&; typename std::iterator_traits< >::value_type = double]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = double&; typename std::iterator_traits< >::value_type = double]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = double&; typename std::iterator_traits< >::value_type = double]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = double&; typename std::iterator_traits< >::value_type = double]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = double&; typename std::iterator_traits< >::value_type = double]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = double&; typename std::iterator_traits< >::value_type = double]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = double&; typename std::iterator_traits< >::value_type = double]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = double&; typename std::iterator_traits< >::value_type = double]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = double&; typename std::iterator_traits< >::value_type = double]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = double&; typename std::iterator_traits< >::value_type = double]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = double&; typename std::iterator_traits< >::value_type = double]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = double&; typename std::iterator_traits< >::value_type = double]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = double&; typename std::iterator_traits< >::value_type = double]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:545:11: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:573:11: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = std::vector, std::allocator > >&; typename std::iterator_traits< >::value_type = std::vector, std::allocator > >]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = boost::default_color_type&; typename std::iterator_traits< >::value_type = boost::default_color_type]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, std::stack::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list >, boost::property > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_unweighted_shortest_paths]’ /home/omnipath/local/R/4.3-3.17/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 boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::property > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >, boost::property > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >, boost::property > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >, boost::property > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >, boost::property > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::property > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >, boost::property > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::property > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >, boost::property > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >, boost::property > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >, boost::property > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::property > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::property > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >, boost::property > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >, boost::property > > >]’: /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list >, boost::property > >; Buffer = boost::queue > >; BFSVisitor = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >, boost::property > >; Buffer = boost::queue > >; BFSVisitor = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, std::stack::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list >, boost::property > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_unweighted_shortest_paths]’ /home/omnipath/local/R/4.3-3.17/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 boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept >, boost::property > > >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list >, boost::property > > >]’: /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list >, boost::property > >; Buffer = boost::queue > >; BFSVisitor = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >, boost::property > >; Buffer = boost::queue > >; BFSVisitor = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, std::stack::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list >, boost::property > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_unweighted_shortest_paths]’ /home/omnipath/local/R/4.3-3.17/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 boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:21, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:13, from bbc.cpp:37: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; Graph = boost::adjacency_list >, boost::property > >]’ 37 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list >, boost::property > >; Buffer = boost::queue > >; BFSVisitor = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >, boost::property > >; Buffer = boost::queue > >; BFSVisitor = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, std::stack::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list >, boost::property > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_unweighted_shortest_paths]’ /home/omnipath/local/R/4.3-3.17/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 boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >, boost::property > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::property > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >, boost::property > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >, boost::property > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >, boost::property > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >, boost::property > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >, boost::property > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >, boost::property > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::property > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >, boost::property > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >, boost::property > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >, boost::property > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::property > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >, boost::property > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; Graph = boost::adjacency_list >, boost::property > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::BFSVisitorConcept >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list >, boost::property > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list >, boost::property > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list >, boost::property > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list >, boost::property > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:65:5: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >, boost::property > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >, boost::property > > >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list >, boost::property > >; Buffer = boost::queue > >; BFSVisitor = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >, boost::property > >; Buffer = boost::queue > >; BFSVisitor = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, std::stack::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list >, boost::property > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:349:31: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >, boost::property > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >, boost::property > > >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list >, boost::property > >; Buffer = boost::queue > >; BFSVisitor = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >, boost::property > >; Buffer = boost::queue > >; BFSVisitor = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, std::stack::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list >, boost::property > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:349:31: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >, boost::property > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >, boost::property > > >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list >, boost::property > >; Buffer = boost::queue > >; BFSVisitor = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >, boost::property > >; Buffer = boost::queue > >; BFSVisitor = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, std::stack::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list >, boost::property > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:349:31: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >, boost::property > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >, boost::property > > >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list >, boost::property > >; Buffer = boost::queue > >; BFSVisitor = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >, boost::property > >; Buffer = boost::queue > >; BFSVisitor = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, std::stack::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list >, boost::property > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:349:31: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >, boost::property > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >, boost::property > > >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list >, boost::property > >; Buffer = boost::queue > >; BFSVisitor = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >, boost::property > >; Buffer = boost::queue > >; BFSVisitor = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, std::stack::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list >, boost::property > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:349:31: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::WritablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >, boost::property > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >, boost::property > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::property > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >, boost::property > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >, boost::property > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >, boost::property > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >, boost::property > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::property > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >, boost::property > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >, boost::property > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >, boost::property > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >, boost::property > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::property > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >, boost::property > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >, boost::property > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >, boost::property > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >, boost::property > > >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list >, boost::property > >; Buffer = boost::queue > >; BFSVisitor = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type >, boost::property > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:118:24: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less >, boost::adjacency_list >, boost::property > > >]’: /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list >, boost::property > >; Buffer = boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >; BFSVisitor = boost::detail::dijkstra_bfs_visitor >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less >; ColorMap = boost::two_bit_color_map >, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list >, boost::property > >; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::detail::graph::brandes_dijkstra_visitor >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Compare = std::less; Combine = std::plus; DistZero = double; ColorMap = boost::two_bit_color_map >, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list >, boost::property > >; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::detail::graph::brandes_dijkstra_visitor >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; ColorMap = boost::two_bit_color_map >, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/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 boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = boost::adjacency_list >, boost::property > >; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::detail::graph::brandes_dijkstra_visitor >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = char; Tag = boost::detail::unused_tag_type; Base = boost::no_property; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list >, boost::property > >; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::detail::graph::brandes_dijkstra_visitor >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.17/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 boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:21, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:13, from bbc.cpp:37: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less >; Graph = boost::adjacency_list >, boost::property > >]’ 37 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list >, boost::property > >; Buffer = boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >; BFSVisitor = boost::detail::dijkstra_bfs_visitor >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less >; ColorMap = boost::two_bit_color_map >, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list >, boost::property > >; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::detail::graph::brandes_dijkstra_visitor >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Compare = std::less; Combine = std::plus; DistZero = double; ColorMap = boost::two_bit_color_map >, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list >, boost::property > >; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::detail::graph::brandes_dijkstra_visitor >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; ColorMap = boost::two_bit_color_map >, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/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 boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = boost::adjacency_list >, boost::property > >; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::detail::graph::brandes_dijkstra_visitor >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = char; Tag = boost::detail::unused_tag_type; Base = boost::no_property; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list >, boost::property > >; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::detail::graph::brandes_dijkstra_visitor >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.17/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 boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map >, long unsigned int> >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.17/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 boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less >; Graph = boost::adjacency_list >, boost::property > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::BFSVisitorConcept >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less >, boost::adjacency_list >, boost::property > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less >, boost::adjacency_list >, boost::property > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less >, boost::adjacency_list >, boost::property > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less >, boost::adjacency_list >, boost::property > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:65:5: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.17/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 boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map >, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.17/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 boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map >, long unsigned int> >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map >, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.17/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 boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map >, long unsigned int> >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.17/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 boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map >, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.17/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 boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::property > >*, std::vector > > >, boost::property > >, std::allocator > > >, boost::property > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >, boost::property > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.17/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 boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.17/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 boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.17/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 boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.17/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 boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.17/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 boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.17/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 boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.17/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 boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = long unsigned int*; ID = boost::vec_adj_list_vertex_id_map >, long unsigned int>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:245:46: required from ‘static boost::detail::vertex_property_map_generator_helper::type boost::detail::vertex_property_map_generator_helper::build(const Graph&, const IndexMap&, boost::scoped_array&) [with Graph = boost::adjacency_list >, boost::property > >; IndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Value = long unsigned int; boost::detail::vertex_property_map_generator_helper::type = boost::iterator_property_map >, long unsigned int>, long unsigned int, long unsigned int&>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:273:33: required from ‘static boost::detail::vertex_property_map_generator::type boost::detail::vertex_property_map_generator::build(const Graph&, const IndexMap&, boost::scoped_array&) [with Graph = boost::adjacency_list >, boost::property > >; IndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Value = long unsigned int; boost::detail::vertex_property_map_generator::type = boost::iterator_property_map >, long unsigned int>, long unsigned int, long unsigned int&>]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list >, boost::property > >; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::detail::graph::brandes_dijkstra_visitor >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Compare = std::less; Combine = std::plus; DistZero = double; ColorMap = boost::two_bit_color_map >, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list >, boost::property > >; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::detail::graph::brandes_dijkstra_visitor >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; ColorMap = boost::two_bit_color_map >, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.17/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 boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.17/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 boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::dijkstra_bfs_visitor >, boost::property > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>, std::plus, std::less >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.17/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 boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map >, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept >, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.17/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 boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.17/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 boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map >, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::WritablePropertyMapConcept >, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.17/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 boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from bbc.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.17/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 boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::vec_adj_list_vertex_id_map >, long unsigned int>; Tag = boost::vertex_index_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::no_property>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = boost::adjacency_list >, boost::property > >; Done = clustering_threshold; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>]’ bbc.cpp:149:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.17/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 boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.17/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 boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.17/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 boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.17/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 boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.17/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 boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.17/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 boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.17/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 boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 22 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.17/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 boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 22 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths >, boost::edge_weight_t> >]’ /home/omnipath/local/R/4.3-3.17/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 boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list >, boost::property > >; CentralityMap = boost::vec_adj_list_vertex_property_map >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list >, boost::property > >; Param = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Tag = boost::edge_weight_t; Rest = boost::bgl_named_params >, boost::edge_centrality_t>, boost::edge_centrality_t, boost::bgl_named_params >, boost::property > >, boost::adjacency_list >, boost::property > >*, double, double&, boost::vertex_centrality_t>, boost::vertex_centrality_t, boost::no_property> >; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ bbc.cpp:67:33: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/opt/R-devel/lib/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.17/BH/include' -I/usr/local/include -fpic -g -O2 -c cliques.cpp -o cliques.o In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from cliques.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from cliques.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from cliques.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:250:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 250 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from cliques.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from cliques.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:507:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 507 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from cliques.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from cliques.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:520:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 520 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from cliques.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from cliques.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:603:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 603 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from cliques.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from cliques.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:612:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 612 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from cliques.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from cliques.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:614:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 614 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from cliques.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38, from cliques.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/scoped_ptr.hpp:74:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 74 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from cliques.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ g++ -std=gnu++17 -I"/opt/R-devel/lib/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.17/BH/include' -I/usr/local/include -fpic -g -O2 -c clusteringCoef.cpp -o clusteringCoef.o In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from clusteringCoef.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from clusteringCoef.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from clusteringCoef.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:250:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 250 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from clusteringCoef.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from clusteringCoef.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:507:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 507 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from clusteringCoef.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from clusteringCoef.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:520:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 520 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from clusteringCoef.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from clusteringCoef.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:603:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 603 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from clusteringCoef.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from clusteringCoef.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:612:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 612 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from clusteringCoef.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from clusteringCoef.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:614:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 614 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from clusteringCoef.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38, from clusteringCoef.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/scoped_ptr.hpp:74:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 74 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from clusteringCoef.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ g++ -std=gnu++17 -I"/opt/R-devel/lib/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.17/BH/include' -I/usr/local/include -fpic -g -O2 -c dominatorTree.cpp -o dominatorTree.o In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from dominatorTree.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:250:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 250 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from dominatorTree.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:507:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 507 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from dominatorTree.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:520:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 520 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from dominatorTree.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:603:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 603 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from dominatorTree.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:612:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 612 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from dominatorTree.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:614:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 614 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from dominatorTree.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/scoped_ptr.hpp:74:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 74 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from dominatorTree.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraphConcept > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraphConcept > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:123:5: required from ‘struct boost::concepts::BidirectionalGraph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraphConcept > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::BidirectionalGraph > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:118:15: note: in a call to non-static member function ‘boost::concepts::BidirectionalGraphConcept > >::~BidirectionalGraphConcept()’ 118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G > | ^~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:118:1: note: in expansion of macro ‘BOOST_concept’ 118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraphConcept > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::BidirectionalGraph > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:123:5: required from ‘struct boost::concepts::BidirectionalGraph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraphConcept > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:123:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 123 | BOOST_CONCEPT_USAGE(BidirectionalGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = boost::default_color_type&; typename std::iterator_traits< >::value_type = boost::default_color_type]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = boost::default_color_type&; typename std::iterator_traits< >::value_type = boost::default_color_type]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = boost::default_color_type&; typename std::iterator_traits< >::value_type = boost::default_color_type]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = boost::default_color_type&; typename std::iterator_traits< >::value_type = boost::default_color_type]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = boost::default_color_type&; typename std::iterator_traits< >::value_type = boost::default_color_type]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = boost::default_color_type&; typename std::iterator_traits< >::value_type = boost::default_color_type]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = boost::default_color_type&; typename std::iterator_traits< >::value_type = boost::default_color_type]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = boost::default_color_type&; typename std::iterator_traits< >::value_type = boost::default_color_type]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:545:11: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:573:11: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:126:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:126:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::bidir_adj_list_traversal_tag; Y = boost::bidirectional_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = boost::default_color_type&; typename std::iterator_traits< >::value_type = boost::default_color_type]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = boost::default_color_type&; typename std::iterator_traits< >::value_type = boost::default_color_type]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = boost::default_color_type&; typename std::iterator_traits< >::value_type = boost::default_color_type]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = boost::default_color_type&; typename std::iterator_traits< >::value_type = boost::default_color_type]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = boost::default_color_type&; typename std::iterator_traits< >::value_type = boost::default_color_type]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = boost::default_color_type&; typename std::iterator_traits< >::value_type = boost::default_color_type]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = boost::default_color_type&; typename std::iterator_traits< >::value_type = boost::default_color_type]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > >]’: /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept > >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >, boost::adjacency_list > >]’: /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:15, from dominatorTree.cpp:2: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; Graph = boost::adjacency_list >]’ 39 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’: /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::ColorValueConcept]’: /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:15: note: in a call to non-static member function ‘boost::concepts::ColorValueConcept::~ColorValueConcept()’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: note: in expansion of macro ‘BOOST_concept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = void*&; typename std::iterator_traits< >::value_type = void*]’ dominatorTree.cpp:44:40: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::bidir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:126:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::bidir_adj_list_traversal_tag; Y = boost::bidirectional_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >, boost::adjacency_list > >)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; Graph = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DFSVisitorConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >, boost::adjacency_list > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >, boost::adjacency_list > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >, boost::adjacency_list > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >, boost::adjacency_list > >)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::ColorValue::~ColorValue() [with C = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:505:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 505 | BOOST_CONCEPT_USAGE(ColorValue) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = std::deque >&; typename std::iterator_traits< >::value_type = std::deque >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; boost::detail::dominator_visitor::Vertex = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = std::deque >&; typename std::iterator_traits< >::value_type = std::deque >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; boost::detail::dominator_visitor::Vertex = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = std::deque >&; typename std::iterator_traits< >::value_type = std::deque >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; boost::detail::dominator_visitor::Vertex = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = std::deque >&; typename std::iterator_traits< >::value_type = std::deque >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; boost::detail::dominator_visitor::Vertex = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = std::deque >&; typename std::iterator_traits< >::value_type = std::deque >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; boost::detail::dominator_visitor::Vertex = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = std::deque >&; typename std::iterator_traits< >::value_type = std::deque >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; boost::detail::dominator_visitor::Vertex = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = std::deque >&; typename std::iterator_traits< >::value_type = std::deque >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; boost::detail::dominator_visitor::Vertex = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = std::deque >&; typename std::iterator_traits< >::value_type = std::deque >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; boost::detail::dominator_visitor::Vertex = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/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 >, std::allocator > > > > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::bidir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >, boost::adjacency_list > >)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::WritablePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = std::deque >&; typename std::iterator_traits< >::value_type = std::deque >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; boost::detail::dominator_visitor::Vertex = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = std::deque >&; typename std::iterator_traits< >::value_type = std::deque >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; boost::detail::dominator_visitor::Vertex = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = std::deque >&; typename std::iterator_traits< >::value_type = std::deque >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; boost::detail::dominator_visitor::Vertex = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = std::deque >&; typename std::iterator_traits< >::value_type = std::deque >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; boost::detail::dominator_visitor::Vertex = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = std::deque >&; typename std::iterator_traits< >::value_type = std::deque >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; boost::detail::dominator_visitor::Vertex = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = std::deque >&; typename std::iterator_traits< >::value_type = std::deque >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; boost::detail::dominator_visitor::Vertex = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = std::deque >&; typename std::iterator_traits< >::value_type = std::deque >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; boost::detail::dominator_visitor::Vertex = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::dfs_visitor >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from dominatorTree.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph::~BidirectionalGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BidirectionalGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::adjacency_list >; IndexMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, void*, void*&>; VertexVector = std::vector; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits::vertex_descriptor&, DomTreePredMap) [with Graph = boost::adjacency_list >; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t> >; typename boost::graph_traits::vertex_descriptor = void*]’ dominatorTree.cpp:46:36: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/opt/R-devel/lib/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.17/BH/include' -I/usr/local/include -fpic -g -O2 -c edmonds_optimum_branching.cpp -o edmonds_optimum_branching.o In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:250:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 250 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:507:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 507 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:520:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 520 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:603:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 603 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:612:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 612 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:614:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 614 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/scoped_ptr.hpp:74:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 74 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept >::~EdgeListGraphConcept()’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::ReadablePropertyMapConcept, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::ReadablePropertyMapConcept, long unsigned int>, long unsigned int>]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::InputIteratorConcept]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::InputIteratorConcept]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::InputIteratorConcept]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIteratorConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::InputIteratorConcept]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:17: note: in a call to non-static member function ‘boost::InputIteratorConcept::~InputIteratorConcept()’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: note: in expansion of macro ‘BOOST_concept’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:529:5: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::OutputIterator > >, boost::detail::edge_desc_impl >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:526:17: note: in a call to non-static member function ‘boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >::~OutputIteratorConcept()’ 526 | BOOST_concept(OutputIterator,(TT)(ValueT)) | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:526:3: note: in expansion of macro ‘BOOST_concept’ 526 | BOOST_concept(OutputIterator,(TT)(ValueT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EdgeListGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::ReadablePropertyMapConcept, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::ReadablePropertyMapConcept, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::ReadablePropertyMapConcept, long unsigned int>, long unsigned int>]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, long unsigned int>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::ReadablePropertyMapConcept, long unsigned int>, long unsigned int>]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::InputIteratorConcept]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::InputIteratorConcept]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::InputIteratorConcept]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = std::back_insert_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::OutputIterator > >, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:529:5: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::OutputIterator::~OutputIterator() [with TT = std::back_insert_iterator > >; ValueT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:529:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 529 | BOOST_CONCEPT_USAGE(OutputIterator) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::ReadablePropertyMapConcept, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::ReadablePropertyMapConcept, long unsigned int>, long unsigned int>]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::readable_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::InputIteratorConcept]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::InputIteratorConcept]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::InputIteratorConcept]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::InputIteratorConcept]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from edmonds_optimum_branching.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = boost::concepts::EdgeListGraphConcept >]’ 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; TVertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator > >]’ edmonds_optimum_branching.cpp:36:47: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/opt/R-devel/lib/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.17/BH/include' -I/usr/local/include -fpic -g -O2 -c hcs.cpp -o hcs.o In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from hcs.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:250:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 250 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from hcs.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:507:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 507 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from hcs.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:520:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 520 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from hcs.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:603:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 603 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from hcs.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:612:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 612 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from hcs.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:614:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 614 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from hcs.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/scoped_ptr.hpp:74:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 74 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from hcs.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:22, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edge_connectivity.hpp:19, from mincut.hpp:4, from hcs.cpp:2: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor*, boost::on_tree_edge> >; Graph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept]’: /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, boost::on_tree_edge> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible*, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept*, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept*, boost::on_tree_edge> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, boost::on_tree_edge> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, boost::on_tree_edge> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible*, boost::on_tree_edge> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept*, boost::on_tree_edge> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:39:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor*, boost::on_tree_edge> >; Graph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::BFSVisitorConcept*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept*, boost::on_tree_edge> > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible*, boost::on_tree_edge> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, boost::on_tree_edge> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible*, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept*, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept*, boost::on_tree_edge> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, boost::on_tree_edge> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::bfs_visitor*, boost::on_tree_edge> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::WritablePropertyMapConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from hcs.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ hcs.cpp:299:31: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/opt/R-devel/lib/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.17/BH/include' -I/usr/local/include -fpic -g -O2 -c incrConnComp.cpp -o incrConnComp.o In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from incrConnComp.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from incrConnComp.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from incrConnComp.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:250:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 250 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from incrConnComp.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from incrConnComp.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:507:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 507 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from incrConnComp.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from incrConnComp.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:520:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 520 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from incrConnComp.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from incrConnComp.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:603:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 603 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from incrConnComp.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from incrConnComp.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:612:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 612 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from incrConnComp.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from incrConnComp.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:614:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 614 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from incrConnComp.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38, from incrConnComp.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/scoped_ptr.hpp:74:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 74 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from incrConnComp.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ g++ -std=gnu++17 -I"/opt/R-devel/lib/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.17/BH/include' -I/usr/local/include -fpic -g -O2 -c interfaces.cpp -o interfaces.o In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from interfaces.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:250:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 250 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from interfaces.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:507:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 507 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from interfaces.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:520:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 520 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from interfaces.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:603:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 603 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from interfaces.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:612:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 612 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from interfaces.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:614:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 614 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from interfaces.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/scoped_ptr.hpp:74:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 74 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from interfaces.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:76:5: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = int*; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::WritablePropertyMapConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:76:5: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = int*; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::WritablePropertyMapConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:76:5: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::WritablePropertyMapConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:76:5: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept, R_adjacency_list >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = dfs_time_visitor; Graph = R_adjacency_list]’ 39 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, R_adjacency_list >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = dfs_time_visitor; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DFSVisitorConcept, R_adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, R_adjacency_list > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, R_adjacency_list > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, R_adjacency_list >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’: /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::ColorValueConcept]’: /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:15: note: in a call to non-static member function ‘boost::concepts::ColorValueConcept::~ColorValueConcept()’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: note: in expansion of macro ‘BOOST_concept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept, R_adjacency_list >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::components_recorder; Graph = R_adjacency_list]’ 39 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor*, boost::on_tree_edge> >; Graph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept]’: /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:545:11: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:573:11: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept > >, R_adjacency_list >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; OutputIterator = std::front_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::front_insert_iterator >]’ interfaces.cpp:71:29: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::topo_sort_visitor > >; Graph = R_adjacency_list]’ 39 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept, R_adjacency_list >]’: /home/omnipath/local/R/4.3-3.17/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; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = bfs_time_visitor; Graph = R_adjacency_list]’ 37 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/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; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, R_adjacency_list >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = dfs_time_visitor]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::ColorValue::~ColorValue() [with C = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:505:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 505 | BOOST_CONCEPT_USAGE(ColorValue) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::components_recorder; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DFSVisitorConcept, R_adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, R_adjacency_list > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, R_adjacency_list > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, R_adjacency_list >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’: /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:188:9: required from ‘std::pair boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept >::~VertexListGraphConcept()’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro ‘BOOST_concept’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:190:9: required from ‘std::pair boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::dummy_property_map; Key = boost::detail::edge_desc_impl]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:192:9: required from ‘std::pair boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, boost::on_tree_edge> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible*, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept*, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept*, boost::on_tree_edge> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, boost::on_tree_edge> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, boost::on_tree_edge> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible*, boost::on_tree_edge> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept*, boost::on_tree_edge> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor*, boost::on_tree_edge> >; Graph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::BFSVisitorConcept*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept*, boost::on_tree_edge> > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::typed_identity_property_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list; ColorMap = boost::iterator_property_map, long unsigned int> >; typename boost::property_traits::value_type = long unsigned int]’ interfaces.cpp:370:56: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; OutputIterator = std::front_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::front_insert_iterator >]’ interfaces.cpp:71:29: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::topo_sort_visitor > >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DFSVisitorConcept > >, R_adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, R_adjacency_list > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, R_adjacency_list > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; OutputIterator = std::front_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::front_insert_iterator >]’ interfaces.cpp:71:29: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept > > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = bfs_time_visitor; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::BFSVisitorConcept, R_adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, R_adjacency_list > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, R_adjacency_list > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::components_recorder]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:115:9: required from ‘typename boost::property_traits::value_type boost::detail::strong_components_impl(const Graph&, ComponentMap, RootMap, DiscoverTime, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DiscoverTime = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:162:42: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch2::apply(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, DiscoverTimeMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, 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::value_type = int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:249:29: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ interfaces.cpp:232:26: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = int*; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, DiscoverTimeMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, 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::value_type = int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:249:29: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ interfaces.cpp:232:26: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:119:9: required from ‘typename boost::property_traits::value_type boost::detail::strong_components_impl(const Graph&, ComponentMap, RootMap, DiscoverTime, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DiscoverTime = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:162:42: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch2::apply(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, DiscoverTimeMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, 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::value_type = int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:249:29: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ interfaces.cpp:232:26: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:190:9: required from ‘std::pair boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator]’ /home/omnipath/local/R/4.3-3.17/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; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; std::size_t = long unsigned int]’ interfaces.cpp:264:47: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 182 | BOOST_CONCEPT_USAGE(VertexListGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::dummy_property_map; Key = boost::detail::edge_desc_impl]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::WritablePropertyMapConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible*, boost::on_tree_edge> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, boost::on_tree_edge> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible*, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept*, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept*, boost::on_tree_edge> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, boost::on_tree_edge> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::bfs_visitor*, boost::on_tree_edge> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; OutputIterator = std::front_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::front_insert_iterator >]’ interfaces.cpp:71:29: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::topo_sort_visitor > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = bfs_time_visitor]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = int*; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:115:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, DiscoverTimeMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, 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::value_type = int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:249:29: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ interfaces.cpp:232:26: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = int*; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, DiscoverTimeMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, 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::value_type = int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:249:29: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ interfaces.cpp:232:26: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = long unsigned int; Y = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:184:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:188:9: required from ‘std::pair boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:185:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:188:9: required from ‘std::pair boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list; Buffer = boost::queue > >; BFSVisitor = bfs_time_visitor; ColorMap = boost::two_bit_color_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = R_adjacency_list; ColorMap = boost::two_bit_color_map, long unsigned int> >; BFSVisitor = bfs_time_visitor; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; P = bfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ interfaces.cpp:113:29: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:188:9: required from ‘std::pair boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::biconnected_components_visitor >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:211:27: required from ‘std::pair boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::biconnected_components_visitor >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >; Graph = R_adjacency_list]’ 39 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::components_recorder; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::components_recorder; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ interfaces.cpp:205:29: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >, R_adjacency_list >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::tarjan_scc_visitor >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::tarjan_scc_visitor >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; T = boost::graph_visitor_t; R = boost::bgl_named_params; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:129:27: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, DiscoverTimeMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, 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::value_type = int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:249:29: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ interfaces.cpp:232:26: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::tarjan_scc_visitor >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; Graph = R_adjacency_list]’ 39 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::biconnected_components_visitor, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:211:27: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator]’ /home/omnipath/local/R/4.3-3.17/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; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; std::size_t = long unsigned int]’ interfaces.cpp:264:47: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::biconnected_components_visitor, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >; Graph = R_adjacency_list]’ 39 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::biconnected_components_visitor >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DFSVisitorConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:130:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = dfs_time_visitor; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = dfs_time_visitor; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ interfaces.cpp:158:27: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, DiscoverTimeMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, 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::value_type = int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:249:29: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ interfaces.cpp:232:26: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::tarjan_scc_visitor >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DFSVisitorConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >, R_adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >, R_adjacency_list > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >, R_adjacency_list > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >, R_adjacency_list >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:130:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, DiscoverTimeMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, 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::value_type = int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:249:29: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ interfaces.cpp:232:26: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator]’ /home/omnipath/local/R/4.3-3.17/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; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; std::size_t = long unsigned int]’ interfaces.cpp:264:47: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::biconnected_components_visitor, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DFSVisitorConcept, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:130:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator]’ /home/omnipath/local/R/4.3-3.17/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; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; std::size_t = long unsigned int]’ interfaces.cpp:264:47: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from interfaces.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list; OutputIterator = std::back_insert_iterator >]’ interfaces.cpp:300:28: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::biconnected_components_visitor >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edge_connectivity.hpp:145:42: required from ‘typename boost::graph_traits::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator > >; typename boost::graph_traits::degree_size_type = long unsigned int]’ interfaces.cpp:326:34: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, DiscoverTimeMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, 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::value_type = int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:249:29: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = int*; typename boost::property_traits::value_type = int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ interfaces.cpp:232:26: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::tarjan_scc_visitor >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = R_adjacency_list; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator]’ /home/omnipath/local/R/4.3-3.17/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; ComponentMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; std::size_t = long unsigned int]’ interfaces.cpp:264:47: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::biconnected_components_visitor, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/opt/R-devel/lib/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.17/BH/include' -I/usr/local/include -fpic -g -O2 -c minST.cpp -o minST.o In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from minST.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:250:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 250 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from minST.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:507:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 507 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from minST.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:520:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 520 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from minST.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:603:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 603 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from minST.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:612:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 612 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from minST.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:614:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 614 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from minST.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/scoped_ptr.hpp:74:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 74 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from minST.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’: /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept >::~VertexListGraphConcept()’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro ‘BOOST_concept’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’: /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept >::~EdgeListGraphConcept()’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:529:5: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::OutputIterator > >, boost::detail::edge_desc_impl >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:526:17: note: in a call to non-static member function ‘boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >::~OutputIteratorConcept()’ 526 | BOOST_concept(OutputIterator,(TT)(ValueT)) | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:526:3: note: in expansion of macro ‘BOOST_concept’ 526 | BOOST_concept(OutputIterator,(TT)(ValueT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:251:3: required from ‘struct boost::ComparableConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ComparableConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ComparableConcept]’: /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:251:17: note: in a call to non-static member function ‘boost::ComparableConcept::~ComparableConcept()’ 251 | BOOST_concept(Comparable,(TT)) | ^~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:251:3: note: in expansion of macro ‘BOOST_concept’ 251 | BOOST_concept(Comparable,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::IntegerConcept]’: /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:70:17: note: in a call to non-static member function ‘boost::IntegerConcept::~IntegerConcept()’ 70 | BOOST_concept(Integer, (T)) | ^~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:70:3: note: in expansion of macro ‘BOOST_concept’ 70 | BOOST_concept(Integer, (T)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’: /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept >::~VertexListGraphConcept()’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro ‘BOOST_concept’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’: /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept >::~EdgeListGraphConcept()’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:529:5: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::OutputIterator > >, boost::detail::edge_desc_impl >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:526:17: note: in a call to non-static member function ‘boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >::~OutputIteratorConcept()’ 526 | BOOST_concept(OutputIterator,(TT)(ValueT)) | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:526:3: note: in expansion of macro ‘BOOST_concept’ 526 | BOOST_concept(OutputIterator,(TT)(ValueT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 182 | BOOST_CONCEPT_USAGE(VertexListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EdgeListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = std::back_insert_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::OutputIterator > >, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:529:5: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::OutputIterator::~OutputIterator() [with TT = std::back_insert_iterator > >; ValueT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:529:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 529 | BOOST_CONCEPT_USAGE(OutputIterator) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:251:3: required from ‘struct boost::ComparableConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ComparableConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = double]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = long unsigned int; Y = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 182 | BOOST_CONCEPT_USAGE(VertexListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EdgeListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = std::back_insert_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::OutputIterator > >, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:529:5: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::OutputIterator::~OutputIterator() [with TT = std::back_insert_iterator > >; ValueT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:529:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 529 | BOOST_CONCEPT_USAGE(OutputIterator) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::WritablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter > >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:545:11: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:573:11: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter > >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter > >, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::undirected_edge_iter > >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::undirected_edge_iter > >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::undirected_edge_iter > >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::undirected_edge_iter > >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::undirected_edge_iter > >, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter > >, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:20:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::back_insert_iterator > >]’ minST.cpp:54:38: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’: /home/omnipath/local/R/4.3-3.17/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; Buffer = boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >; BFSVisitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less >; ColorMap = boost::two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::detail::_project2nd; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/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; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::detail::_project2nd; DistInf = double; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/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 boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::detail::_project2nd; DistInf = double; DistZero = double; T = char; Tag = boost::detail::unused_tag_type; Base = boost::no_property; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less >, R_adjacency_list >]’: /home/omnipath/local/R/4.3-3.17/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; Buffer = boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >; BFSVisitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less >; ColorMap = boost::two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::detail::_project2nd; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/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; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::detail::_project2nd; DistInf = double; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/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 boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::detail::_project2nd; DistInf = double; DistZero = double; T = char; Tag = boost::detail::unused_tag_type; Base = boost::no_property; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:21, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:15, from minST.cpp:3: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less >; Graph = R_adjacency_list]’ 37 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/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; Buffer = boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >; BFSVisitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less >; ColorMap = boost::two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::detail::_project2nd; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/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; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::detail::_project2nd; DistInf = double; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/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 boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::detail::_project2nd; DistInf = double; DistZero = double; T = char; Tag = boost::detail::unused_tag_type; Base = boost::no_property; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:39:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::BFSVisitorConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less >, R_adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less >, R_adjacency_list > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less >, R_adjacency_list > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less >, R_adjacency_list >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:65:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:59:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:59:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:59:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = long unsigned int*; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:245:46: required from ‘static boost::detail::vertex_property_map_generator_helper::type boost::detail::vertex_property_map_generator_helper::build(const Graph&, const IndexMap&, boost::scoped_array&) [with Graph = R_adjacency_list; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Value = long unsigned int; boost::detail::vertex_property_map_generator_helper::type = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:273:33: required from ‘static boost::detail::vertex_property_map_generator::type boost::detail::vertex_property_map_generator::build(const Graph&, const IndexMap&, boost::scoped_array&) [with Graph = R_adjacency_list; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Value = long unsigned int; boost::detail::vertex_property_map_generator::type = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>]’ /home/omnipath/local/R/4.3-3.17/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; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::detail::_project2nd; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/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; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::detail::_project2nd; DistInf = double; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; Buffer = boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >; BFSVisitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less >; ColorMap = boost::two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::detail::_project2nd; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/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; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::detail::_project2nd; DistInf = double; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; Buffer = boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >; BFSVisitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less >; ColorMap = boost::two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::detail::_project2nd; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/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; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::detail::_project2nd; DistInf = double; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::WritablePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; Buffer = boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >; BFSVisitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>, boost::detail::_project2nd, std::less >; ColorMap = boost::two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from minST.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params, boost::distance_combine_t, boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = boost::detail::_project2nd; Tag = boost::distance_combine_t; Rest = boost::bgl_named_params, boost::distance_compare_t, boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params > >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, const boost::bgl_named_params&, Weight) [with Graph = R_adjacency_list; P = boost::adj_list_edge_property_map, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; PredecessorMap = long unsigned int*]’ minST.cpp:89:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/opt/R-devel/lib/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.17/BH/include' -I/usr/local/include -fpic -g -O2 -c mincut.cpp -o mincut.o In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from mincut.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:250:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 250 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from mincut.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:507:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 507 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from mincut.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:520:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 520 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from mincut.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:603:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 603 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from mincut.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:612:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 612 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from mincut.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:614:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 614 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from mincut.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/scoped_ptr.hpp:74:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 74 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from mincut.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/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, std::allocator > > > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:22, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edge_connectivity.hpp:19, from mincut.hpp:4, from mincut.cpp:2: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor*, boost::on_tree_edge> >; Graph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept]’: /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, boost::on_tree_edge> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible*, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept*, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept*, boost::on_tree_edge> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, boost::on_tree_edge> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, boost::on_tree_edge> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible*, boost::on_tree_edge> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept*, boost::on_tree_edge> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:39:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor*, boost::on_tree_edge> >; Graph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::BFSVisitorConcept*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, boost::on_tree_edge> >, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept*, boost::on_tree_edge> > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:545:11: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:573:11: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible*, boost::on_tree_edge> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, boost::on_tree_edge> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible*, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept*, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept*, boost::on_tree_edge> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, boost::on_tree_edge> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::bfs_visitor*, boost::on_tree_edge> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::WritablePropertyMapConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:22, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edge_connectivity.hpp:19, from mincut.hpp:4, from mincut.cpp:2: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; Graph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:39:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; Graph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::BFSVisitorConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:65:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:136:24: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from mincut.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > >, boost::no_property, boost::listS>, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, boost::on_tree_edge> >; ColorMap = boost::default_color_type*; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > >, boost::no_property, boost::listS>; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, boost::detail::edge_desc_impl&, long unsigned int, boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::default_color_type*; PredEdgeMap = boost::detail::edge_desc_impl*; typename boost::property_traits::value_type = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.hpp:78:21: required from ‘typename boost::graph_traits::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list; OutputIterator = std::back_insert_iterator >; typename boost::graph_traits::edges_size_type = long unsigned int]’ mincut.cpp:128:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ mincut.cpp:76:45: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/opt/R-devel/lib/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.17/BH/include' -I/usr/local/include -fpic -g -O2 -c ordering.cpp -o ordering.o In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from ordering.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:250:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 250 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from ordering.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:507:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 507 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from ordering.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:520:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 520 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from ordering.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:603:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 603 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from ordering.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:612:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 612 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from ordering.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:614:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 614 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from ordering.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/scoped_ptr.hpp:74:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 74 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from ordering.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/bind/mem_fn.hpp:25, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/bind/bind.hpp:26, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/king_ordering.hpp:18, from ordering.cpp:9: /home/omnipath/local/R/4.3-3.17/BH/include/boost/get_pointer.hpp:48:40: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 48 | template T * get_pointer(std::auto_ptr const& p) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from ordering.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/pending/bucket_sorter.hpp:32:5: required from ‘class boost::bucket_sorter, long unsigned int>, int, int&>, boost::vec_adj_list_vertex_id_map, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/minimum_degree_ordering.hpp:336:21: required from ‘class boost::detail::mmd_impl, boost::iterator_property_map, long unsigned int>, int, int&>, int*, int*, boost::iterator_property_map, long unsigned int>, int, int&>, boost::vec_adj_list_vertex_id_map, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/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; DegreeMap = boost::iterator_property_map, long unsigned int>, int, int&>; InversePermutationMap = int*; PermutationMap = int*; SuperNodeMap = boost::iterator_property_map, long unsigned int>, int, int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:141:26: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = long unsigned int*; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:116:60: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = int*; Value = int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:142:30: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/pending/bucket_sorter.hpp:32:5: required from ‘class boost::bucket_sorter, long unsigned int>, int, int&>, boost::vec_adj_list_vertex_id_map, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/minimum_degree_ordering.hpp:336:21: required from ‘class boost::detail::mmd_impl, boost::iterator_property_map, long unsigned int>, int, int&>, int*, int*, boost::iterator_property_map, long unsigned int>, int, int&>, boost::vec_adj_list_vertex_id_map, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/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; DegreeMap = boost::iterator_property_map, long unsigned int>, int, int&>; InversePermutationMap = int*; PermutationMap = int*; SuperNodeMap = boost::iterator_property_map, long unsigned int>, int, int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:141:26: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, long unsigned int>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/pending/bucket_sorter.hpp:32:5: required from ‘class boost::bucket_sorter, long unsigned int>, int, int&>, boost::vec_adj_list_vertex_id_map, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/minimum_degree_ordering.hpp:336:21: required from ‘class boost::detail::mmd_impl, boost::iterator_property_map, long unsigned int>, int, int&>, int*, int*, boost::iterator_property_map, long unsigned int>, int, int&>, boost::vec_adj_list_vertex_id_map, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/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; DegreeMap = boost::iterator_property_map, long unsigned int>, int, int&>; InversePermutationMap = int*; PermutationMap = int*; SuperNodeMap = boost::iterator_property_map, long unsigned int>, int, int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:141:26: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’: /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept, R_adjacency_list >]’: /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:16, from ordering.cpp:2: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::dfs_visitor<>; Graph = R_adjacency_list]’ 39 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::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() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::ColorValueConcept]’: /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:15: note: in a call to non-static member function ‘boost::concepts::ColorValueConcept::~ColorValueConcept()’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: note: in expansion of macro ‘BOOST_concept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/pending/bucket_sorter.hpp:32:5: required from ‘class boost::bucket_sorter, long unsigned int>, int, int&>, boost::vec_adj_list_vertex_id_map, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/minimum_degree_ordering.hpp:336:21: required from ‘class boost::detail::mmd_impl, boost::iterator_property_map, long unsigned int>, int, int&>, int*, int*, boost::iterator_property_map, long unsigned int>, int, int&>, boost::vec_adj_list_vertex_id_map, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/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; DegreeMap = boost::iterator_property_map, long unsigned int>, int, int&>; InversePermutationMap = int*; PermutationMap = int*; SuperNodeMap = boost::iterator_property_map, long unsigned int>, int, int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ ordering.cpp:141:26: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::readable_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:545:11: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:573:11: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept > >::~VertexListGraphConcept()’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro ‘BOOST_concept’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept > >::~EdgeListGraphConcept()’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:321:7: required from ‘struct boost::UnaryFunction >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:454:3: required from ‘struct boost::AdaptableUnaryFunction >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:454:3: required from ‘struct boost::AdaptableUnaryFunctionConcept >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::AdaptableUnaryFunctionConcept >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:504:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::UnaryFunction >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::AdaptableUnaryFunctionConcept >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:504:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:454:17: note: in a call to non-static member function ‘boost::AdaptableUnaryFunctionConcept >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>::~AdaptableUnaryFunctionConcept()’ 454 | BOOST_concept(AdaptableUnaryFunction,(Func)(Return)(Arg)) | ^~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:454:3: note: in expansion of macro ‘BOOST_concept’ 454 | BOOST_concept(AdaptableUnaryFunction,(Func)(Return)(Arg)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, void*>]’: /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Key = void*]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, int, const int&, boost::vertex_index_t>, void*>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:515:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; Key = void*]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, R_adjacency_list > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, R_adjacency_list >)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::dfs_visitor<>; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DFSVisitorConcept, R_adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, R_adjacency_list > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, R_adjacency_list > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, R_adjacency_list >)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::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() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::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() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::ColorValue::~ColorValue() [with C = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:505:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 505 | BOOST_CONCEPT_USAGE(ColorValue) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >, R_adjacency_list >]’: /home/omnipath/local/R/4.3-3.17/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; Buffer = boost::sparse::sparse_ordering_queue > >; BFSVisitor = boost::detail::bfs_rcm_visitor > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = boost::sparse::sparse_ordering_queue > >; BFSVisitor = boost::detail::bfs_rcm_visitor > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/cuthill_mckee_ordering.hpp:105:28: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, std::deque::vertex_descriptor, std::allocator::vertex_descriptor> >, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/detail/sparse_ordering.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/cuthill_mckee_ordering.hpp:15, from ordering.cpp:3: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::bfs_rcm_visitor > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >; Graph = R_adjacency_list]’ 37 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = void*; ID = boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>]’ ordering.cpp:69:31: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 182 | BOOST_CONCEPT_USAGE(VertexListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EdgeListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::UnaryFunction >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:321:7: required from ‘struct boost::UnaryFunction >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:454:3: required from ‘struct boost::AdaptableUnaryFunction >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:454:3: required from ‘struct boost::AdaptableUnaryFunctionConcept >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::AdaptableUnaryFunctionConcept >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:504:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::UnaryFunction::~UnaryFunction() [with Func = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Return = long unsigned int; Arg = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:321:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 321 | BOOST_CONCEPT_USAGE(UnaryFunction) { test(is_void()); } | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, void*>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Key = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, void*>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, void*> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, void*> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, void*>)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Key = void*]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, void*>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Key = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, void*>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, void*> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, void*> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, void*>)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Key = void*]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, int, const int&, boost::vertex_index_t>, void*>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:515:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; Key = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept >, int, const int&, boost::vertex_index_t>, void*>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, int, const int&, boost::vertex_index_t>, void*> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, int, const int&, boost::vertex_index_t>, void*> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, int, const int&, boost::vertex_index_t>, void*>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:515:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, R_adjacency_list > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, R_adjacency_list >)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::dfs_visitor<>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::WritablePropertyMapConcept, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >, R_adjacency_list >)>’ /home/omnipath/local/R/4.3-3.17/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; Buffer = boost::sparse::sparse_ordering_queue > >; BFSVisitor = boost::detail::bfs_rcm_visitor > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = boost::sparse::sparse_ordering_queue > >; BFSVisitor = boost::detail::bfs_rcm_visitor > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/cuthill_mckee_ordering.hpp:105:28: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, std::deque::vertex_descriptor, std::allocator::vertex_descriptor> >, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::bfs_rcm_visitor > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::BFSVisitorConcept > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >, R_adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >, R_adjacency_list > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >, R_adjacency_list > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >, R_adjacency_list >)>’ /home/omnipath/local/R/4.3-3.17/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; Buffer = boost::sparse::sparse_ordering_queue > >; BFSVisitor = boost::detail::bfs_rcm_visitor > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = boost::sparse::sparse_ordering_queue > >; BFSVisitor = boost::detail::bfs_rcm_visitor > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/cuthill_mckee_ordering.hpp:105:28: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, std::deque::vertex_descriptor, std::allocator::vertex_descriptor> >, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = std::_List_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:454:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::AdaptableUnaryFunctionConcept >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:504:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:450:11: required from ‘boost::AdaptableUnaryFunction::~AdaptableUnaryFunction() [with Func = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Return = long unsigned int; Arg = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:454:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::AdaptableUnaryFunctionConcept >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:504:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = long unsigned int; Y = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:454:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::AdaptableUnaryFunctionConcept >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:504:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:463:11: required from ‘boost::AdaptableUnaryFunction::~AdaptableUnaryFunction() [with Func = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Return = long unsigned int; Arg = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:454:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::AdaptableUnaryFunctionConcept >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:504:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = void*; Y = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, int, const int&, boost::vertex_index_t>, void*>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:515:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:153:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:530:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:153:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:530:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:153:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:530:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:153:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:530:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:153:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:530:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:153:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:530:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:153:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:530:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::safe_iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_safe_iterator_property_map(RAIter, std::size_t, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = char&; typename std::iterator_traits< >::value_type = char; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:153:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:530:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/iterator/iterator_concepts.hpp:114:7: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/iterator/iterator_concepts.hpp:114:7: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::incrementable_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:152:13: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:152:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:278:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::single_pass_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:278:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:278:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:281:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:281:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:191:13: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:191:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:321:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::forward_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:321:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:321:9: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:322:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:322:9: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:218:14: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:218:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:355:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::bidirectional_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:355:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:355:9: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:356:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:356:9: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:239:14: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:239:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:373:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::random_access_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:373:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:373:9: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:374:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:374:9: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessRangeConcept >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/algorithm/sort.hpp:32:5: required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&) [with RandomAccessRange = std::vector]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/functions.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/iterator_range_core.hpp:38, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/iterator_range.hpp:13, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/irange.hpp:16, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/detail/adjacency_list.hpp:21, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/adjacency_list.hpp:255, from RBGL.hpp:38, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:370:12: note: in a call to non-static member function ‘boost::RandomAccessRangeConcept >::~RandomAccessRangeConcept()’ 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::SinglePassRangeConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:178:27: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SinglePassRangeConcept >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/algorithm/equal.hpp:174:13: required from ‘bool boost::range::equal(const SinglePassRange1&, const SinglePassRange2&) [with SinglePassRange1 = std::vector; SinglePassRange2 = std::vector]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:178:27: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = const std::vector]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:278:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:278:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:281:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:281:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:321:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:321:9: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:322:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:322:9: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:355:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:355:9: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:356:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:356:9: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:373:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:373:9: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:374:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:374:9: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessRangeConcept >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/algorithm/sort.hpp:32:5: required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector; BinaryPredicate = boost::detail::isomorphism_algo >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::compare_multiplicity]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/functions.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/iterator_range_core.hpp:38, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/iterator_range.hpp:13, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/irange.hpp:16, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/detail/adjacency_list.hpp:21, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/adjacency_list.hpp:255, from RBGL.hpp:38, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:370:12: note: in a call to non-static member function ‘boost::RandomAccessRangeConcept >::~RandomAccessRangeConcept()’ 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:214:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:214:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:214:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:214:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:214:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:214:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:214:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::safe_iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_safe_iterator_property_map(RAIter, std::size_t, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; typename std::iterator_traits< >::reference = int&; typename std::iterator_traits< >::value_type = int; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:214:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:278:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:278:9: required from ‘struct boost::SinglePassRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, std::allocator > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:281:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:281:9: required from ‘struct boost::SinglePassRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, std::allocator > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, std::allocator > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept, std::allocator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:321:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:321:9: required from ‘struct boost::ForwardRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, std::allocator > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::allocator > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:322:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:322:9: required from ‘struct boost::ForwardRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, std::allocator > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::allocator > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:355:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:355:9: required from ‘struct boost::BidirectionalRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, std::allocator > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::allocator > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:356:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:356:9: required from ‘struct boost::BidirectionalRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, std::allocator > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::allocator > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:373:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:373:9: required from ‘struct boost::RandomAccessRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, std::allocator > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::allocator > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:374:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:374:9: required from ‘struct boost::RandomAccessRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept, std::allocator > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::allocator > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessRangeConcept, std::allocator > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/algorithm/sort.hpp:32:5: required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector, std::allocator > >; BinaryPredicate = boost::detail::isomorphism_algo >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::edge_cmp]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/functions.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/iterator_range_core.hpp:38, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/iterator_range.hpp:13, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/irange.hpp:16, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/detail/adjacency_list.hpp:21, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/adjacency_list.hpp:255, from RBGL.hpp:38, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:370:12: note: in a call to non-static member function ‘boost::RandomAccessRangeConcept, std::allocator > > >::~RandomAccessRangeConcept()’ 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept, R_adjacency_list >]’: /home/omnipath/local/R/4.3-3.17/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; Buffer = boost::sparse::rcm_queue >, std::deque > >; BFSVisitor = boost::bfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = boost::sparse::rcm_queue >, std::deque > >; BFSVisitor = boost::bfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:363:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with IncidenceGraph = R_adjacency_list; P = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; T = boost::vertex_color_t; R = boost::bgl_named_params >, std::deque > > >, boost::buffer_param_t, boost::no_property>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; Vertex = long unsigned int; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ /home/omnipath/local/R/4.3-3.17/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; Vertex = long unsigned int; Color = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/detail/sparse_ordering.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/cuthill_mckee_ordering.hpp:15, from ordering.cpp:3: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor<>; Graph = R_adjacency_list]’ 37 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >, R_adjacency_list >)>’ /home/omnipath/local/R/4.3-3.17/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; Buffer = boost::sparse::sparse_ordering_queue > >; BFSVisitor = boost::detail::bfs_rcm_visitor > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = boost::sparse::sparse_ordering_queue > >; BFSVisitor = boost::detail::bfs_rcm_visitor > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/cuthill_mckee_ordering.hpp:105:28: required from ‘OutputIterator boost::cuthill_mckee_ordering(const Graph&, std::deque::vertex_descriptor, std::allocator::vertex_descriptor> >, OutputIterator, ColorMap, DegreeMap) [with Graph = R_adjacency_list; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::bfs_rcm_visitor > >, boost::sparse::sparse_ordering_queue > >, boost::degree_property_map > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = std::_List_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:454:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::AdaptableUnaryFunctionConcept >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:504:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = long unsigned int; Y = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:454:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::AdaptableUnaryFunctionConcept >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, long unsigned int, void*>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:504:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = void*; Y = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:153:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:530:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:153:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:530:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:153:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:530:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:153:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:530:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:153:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:530:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:153:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:530:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:153:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:530:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::incrementable_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::single_pass_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = std::vector]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::forward_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::bidirectional_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::random_access_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::SinglePassRangeConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:178:27: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = const std::vector]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = std::vector]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:189:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > >]’: /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::detail::isomorphism_algo >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::detail::isomorphism_algo >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept > >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order, boost::adjacency_list > >]’: /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::detail::isomorphism_algo >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::detail::isomorphism_algo >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:16, from ordering.cpp:2: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::isomorphism_algo >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order; Graph = boost::adjacency_list >]’ 39 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’: /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::detail::isomorphism_algo >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::detail::isomorphism_algo >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:214:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:214:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:214:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:214:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:214:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:214:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:214:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept, std::allocator > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept, std::allocator > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = std::vector, std::allocator > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::iterators::incrementable_traversal_tag> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, boost::iterators::incrementable_traversal_tag>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, boost::iterators::incrementable_traversal_tag>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::iterators::incrementable_traversal_tag> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::iterators::incrementable_traversal_tag> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::iterators::incrementable_traversal_tag>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/iterator/iterator_concepts.hpp:114:7: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, boost::iterators::incrementable_traversal_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, boost::iterators::incrementable_traversal_tag>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/iterator/iterator_concepts.hpp:114:7: required from ‘struct boost::range_detail::IncrementableIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = boost::iterators::incrementable_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::iterators::single_pass_traversal_tag> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, boost::iterators::single_pass_traversal_tag>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, boost::iterators::single_pass_traversal_tag>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::iterators::single_pass_traversal_tag> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::iterators::single_pass_traversal_tag> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::iterators::single_pass_traversal_tag>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:152:13: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, boost::iterators::single_pass_traversal_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, boost::iterators::single_pass_traversal_tag>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:152:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:278:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = boost::iterators::single_pass_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:278:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:278:9: required from ‘struct boost::SinglePassRangeConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::SinglePassRangeConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/algorithm/equal.hpp:174:13: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::SinglePassRangeConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/algorithm/equal.hpp:174:13: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SinglePassRangeConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/algorithm/equal.hpp:174:13: required from ‘typename boost::range_difference::type boost::range::count_if(const SinglePassRange&, UnaryPredicate) [with SinglePassRange = std::pair >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >; UnaryPredicate = boost::indirect_pmap >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, char, char&> >; typename boost::range_difference::type = long int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:304:51: required from ‘bool boost::detail::isomorphism_algo::match(boost::detail::isomorphism_algo::edge_iter, int) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; boost::detail::isomorphism_algo::edge_iter = std::vector, std::allocator > >::iterator]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = const std::pair >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = boost::sparse::rcm_queue >, std::deque > >; BFSVisitor = boost::bfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:363:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with IncidenceGraph = R_adjacency_list; P = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; T = boost::vertex_color_t; R = boost::bgl_named_params >, std::deque > > >, boost::buffer_param_t, boost::no_property>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; Vertex = long unsigned int; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ /home/omnipath/local/R/4.3-3.17/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; Vertex = long unsigned int; Color = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor<>; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::BFSVisitorConcept, R_adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, R_adjacency_list > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, R_adjacency_list > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = boost::sparse::rcm_queue >, std::deque > >; BFSVisitor = boost::bfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:363:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with IncidenceGraph = R_adjacency_list; P = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; T = boost::vertex_color_t; R = boost::bgl_named_params >, std::deque > > >, boost::buffer_param_t, boost::no_property>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; Vertex = long unsigned int; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ /home/omnipath/local/R/4.3-3.17/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; Vertex = long unsigned int; Color = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = void*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = std::_List_iterator]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = std::_List_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::isomorphism_algo >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order; Graph = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DFSVisitorConcept >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order, boost::adjacency_list > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order, boost::adjacency_list > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order, boost::adjacency_list > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order, boost::adjacency_list > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:130:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order>::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, boost::iterators::incrementable_traversal_tag>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::iterators::incrementable_traversal_tag> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, boost::iterators::incrementable_traversal_tag>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, boost::iterators::incrementable_traversal_tag>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::iterators::incrementable_traversal_tag> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::iterators::incrementable_traversal_tag> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = boost::iterators::incrementable_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, boost::iterators::single_pass_traversal_tag>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::iterators::single_pass_traversal_tag> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, boost::iterators::single_pass_traversal_tag>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, boost::iterators::single_pass_traversal_tag>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::iterators::single_pass_traversal_tag> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::iterators::single_pass_traversal_tag> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = boost::iterators::single_pass_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::SinglePassRangeConcept >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = const std::pair >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator >, void*, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; Buffer = boost::sparse::rcm_queue >, std::deque > >; BFSVisitor = boost::bfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:363:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with IncidenceGraph = R_adjacency_list; P = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; T = boost::vertex_color_t; R = boost::bgl_named_params >, std::deque > > >, boost::buffer_param_t, boost::no_property>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; Vertex = long unsigned int; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ /home/omnipath/local/R/4.3-3.17/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; Vertex = long unsigned int; Color = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map >]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::bfs_visitor<>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > > >]’: /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list > > >; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list > > >; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::adjacency_list > > >; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept > > > >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >, boost::adjacency_list > > > >]’: /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list > > >; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list > > >; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::adjacency_list > > >; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/detail/sparse_ordering.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/cuthill_mckee_ordering.hpp:15, from ordering.cpp:3: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; Graph = boost::adjacency_list > > >]’ 37 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept > >, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list > > >; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list > > >; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::adjacency_list > > >; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map > >, long unsigned int> >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = std::_List_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = std::_List_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = std::_List_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::detail::isomorphism_algo >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list >; DFSVisitor = boost::detail::isomorphism_algo >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = void*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::isomorphism_algo >, boost::adjacency_list >, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>, boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t> >::record_dfs_order]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; Graph = boost::adjacency_list > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::BFSVisitorConcept >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >, boost::adjacency_list > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >, boost::adjacency_list > > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >, boost::adjacency_list > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >, boost::adjacency_list > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:65:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept > >, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map > >, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept > >, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map > >, long unsigned int> >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept > >, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map > >, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept > >, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map > >, long unsigned int> >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map > >, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept > >, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = std::_List_iterator]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = std::_List_iterator]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::bidirectional_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::dfs_visitor<>; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; OutputIterator = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; ColorMap = boost::vec_adj_list_vertex_property_map, boost::property, boost::no_property, boost::listS>, boost::adjacency_list, boost::property, boost::no_property, boost::listS>*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map >]’ ordering.cpp:98:25: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > > >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list > > >; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list > > >; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::adjacency_list > > >; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map > >, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept > >, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map > >, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::WritablePropertyMapConcept > >, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::bidirectional_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:129:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >; IsoMapping = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; Invariant1 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; Invariant2 = boost::degree_vertex_invariant >, int, const int&, boost::vertex_index_t> >, boost::adjacency_list > >; IndexMap1 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; IndexMap2 = boost::adj_list_vertex_property_map >, int, const int&, boost::vertex_index_t>; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph1 = boost::adjacency_list >; Graph2 = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; ArgPack = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::isomorphism(const Param0&, const Param1&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list >; Param1 = boost::adjacency_list >; P = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&>; T = boost::vertex_isomorphism_t; R = boost::no_property; typename boost::result_of(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = bool; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::adj_list_vertex_property_map >, int, int&, boost::vertex_index_t>, void*, void*&> >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ ordering.cpp:68:18: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > > >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list > > >; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:136:24: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from ordering.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params&, mpl_::false_) [with VertexListGraph = boost::adjacency_list > > >; ColorMap = boost::two_bit_color_map > >, long unsigned int> >; BFSVisitor = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, boost::on_tree_edge> >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch::apply(VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list > > >; P = boost::bfs_visitor >, boost::vec_adj_list_vertex_id_map > >, 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::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:175:29: required from ‘typename boost::graph_traits::vertex_descriptor boost::sloan_start_end_vertices(Graph&, typename boost::graph_traits::vertex_descriptor&, ColorMap, DegreeMap) [with Graph = boost::adjacency_list > > >; ColorMap = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; DegreeMap = boost::degree_property_map > > > >; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/sloan_ordering.hpp:429:33: required from ‘OutputIterator boost::sloan_ordering(Graph&, OutputIterator, Color, Degree, Priority, Weight, Weight) [with Graph = boost::adjacency_list > > >; OutputIterator = __gnu_cxx::__normal_iterator >; Color = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Degree = boost::degree_property_map > > > >; Priority = boost::vec_adj_list_vertex_property_map > > >, boost::adjacency_list > > >*, double, double&, boost::vertex_priority_t>; Weight = int]’ ordering.cpp:245:17: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter >, boost::no_property> >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/opt/R-devel/lib/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.17/BH/include' -I/usr/local/include -fpic -g -O2 -c planar.cpp -o planar.o In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from planar.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:250:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 250 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from planar.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:507:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 507 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from planar.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:520:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 520 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from planar.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:603:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 603 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from planar.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:612:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 612 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from planar.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:614:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 614 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from planar.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/scoped_ptr.hpp:74:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 74 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from planar.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:76:5: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:76:5: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::WritablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:76:5: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:76:5: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list, boost::property > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = boost::adjacency_list, boost::property >; DFSVisitor = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:12, from planar.cpp:3: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; Graph = boost::adjacency_list, boost::property >]’ 39 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept >::~VertexListGraphConcept()’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro ‘BOOST_concept’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept >::~EdgeListGraphConcept()’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::adjacency_list >, long unsigned int, long unsigned int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:321:7: required from ‘struct boost::UnaryFunction >, boost::adjacency_list >, long unsigned int, long unsigned int>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:454:3: required from ‘struct boost::AdaptableUnaryFunction >, boost::adjacency_list >, long unsigned int, long unsigned int>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:454:3: required from ‘struct boost::AdaptableUnaryFunctionConcept >, boost::adjacency_list >, long unsigned int, long unsigned int>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::AdaptableUnaryFunctionConcept >, boost::adjacency_list >, long unsigned int, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adjacency_list >, long unsigned int, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::UnaryFunction >, boost::adjacency_list >, long unsigned int, long unsigned int>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::AdaptableUnaryFunctionConcept >, boost::adjacency_list >, long unsigned int, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:504:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:454:17: note: in a call to non-static member function ‘boost::AdaptableUnaryFunctionConcept >, boost::adjacency_list >, long unsigned int, long unsigned int>::~AdaptableUnaryFunctionConcept()’ 454 | BOOST_concept(AdaptableUnaryFunction,(Func)(Return)(Arg)) | ^~~~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:454:3: note: in expansion of macro ‘BOOST_concept’ 454 | BOOST_concept(AdaptableUnaryFunction,(Func)(Return)(Arg)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:515:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_id_map; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DFSVisitorConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list, boost::property > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list, boost::property > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list, boost::property > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::property > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph, boost::property > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::property > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::property > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::property > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph, boost::property > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::property > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::property > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph, boost::property > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property > >]’: /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list, boost::property >; DFSVisitor = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = boost::adjacency_list, boost::property >; DFSVisitor = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept, boost::property > >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list, boost::property >; DFSVisitor = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = boost::adjacency_list, boost::property >; DFSVisitor = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::ColorValueConcept]’: /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list, boost::property >; DFSVisitor = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = boost::adjacency_list, boost::property >; DFSVisitor = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:15: note: in a call to non-static member function ‘boost::concepts::ColorValueConcept::~ColorValueConcept()’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: note: in expansion of macro ‘BOOST_concept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:603:11: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph, boost::property > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept, boost::property > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept, boost::property > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph, boost::property > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept, boost::property > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘std::pair boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept, boost::property > >::~VertexListGraphConcept()’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro ‘BOOST_concept’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:190:9: required from ‘std::pair boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; Key = boost::detail::edge_desc_impl]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:192:9: required from ‘std::pair boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair boost::detail::bicomp_dispatch3::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 182 | BOOST_CONCEPT_USAGE(VertexListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EdgeListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::UnaryFunction >, boost::adjacency_list >, long unsigned int, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::adjacency_list >, long unsigned int, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:321:7: required from ‘struct boost::UnaryFunction >, boost::adjacency_list >, long unsigned int, long unsigned int>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:454:3: required from ‘struct boost::AdaptableUnaryFunction >, boost::adjacency_list >, long unsigned int, long unsigned int>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:454:3: required from ‘struct boost::AdaptableUnaryFunctionConcept >, boost::adjacency_list >, long unsigned int, long unsigned int>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::AdaptableUnaryFunctionConcept >, boost::adjacency_list >, long unsigned int, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::UnaryFunction::~UnaryFunction() [with Func = boost::degree_vertex_invariant >, boost::adjacency_list >; Return = long unsigned int; Arg = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:321:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 321 | BOOST_CONCEPT_USAGE(UnaryFunction) { test(is_void()); } | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_id_map; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int>, boost::adjacency_list, boost::property > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = boost::adjacency_list, boost::property >; DFSVisitor = boost::planar_dfs_visitor >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int>; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int>, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:251:27: required from ‘boost::boyer_myrvold_impl::boyer_myrvold_impl(const Graph&, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; StoreOldHandlesPolicy = boost::graph::detail::no_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]’ /home/omnipath/local/R/4.3-3.17/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::property, boost::no_property, boost::listS> > >, std::integral_constant > >; mpl_::true_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.17/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::property, boost::no_property, boost::listS> > >, std::integral_constant > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:223:68: required from ‘bool boost::boyer_myrvold_planarity_test(const A0&) [with A0 = boost::adjacency_list, boost::property >]’ planar.cpp:121:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:12, from planar.cpp:3: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::planar_dfs_visitor >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int>; Graph = boost::adjacency_list, boost::property >]’ 39 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::property > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::property > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph, boost::property > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::property > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::property > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list, boost::property >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph, boost::property > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph, boost::property > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::property > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::property > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::ColorValue::~ColorValue() [with C = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:505:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 505 | BOOST_CONCEPT_USAGE(ColorValue) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:545:11: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:573:11: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph, boost::property > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph, boost::property > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept, boost::property > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept, boost::property > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list, boost::property >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 182 | BOOST_CONCEPT_USAGE(VertexListGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:192:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:184:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:185:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:239:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:450:11: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:450:11: required from ‘boost::AdaptableUnaryFunction::~AdaptableUnaryFunction() [with Func = boost::degree_vertex_invariant >, boost::adjacency_list >; Return = long unsigned int; Arg = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:454:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::AdaptableUnaryFunctionConcept >, boost::adjacency_list >, long unsigned int, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:504:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = long unsigned int; Y = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::readable_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::safe_iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_safe_iterator_property_map(RAIter, std::size_t, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::vec_adj_list_vertex_id_map; typename std::iterator_traits< >::reference = char&; typename std::iterator_traits< >::value_type = char; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:153:51: required from ‘boost::detail::isomorphism_algo::isomorphism_algo(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:530:9: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/iterator/iterator_concepts.hpp:114:7: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/iterator/iterator_concepts.hpp:114:7: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::incrementable_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:152:13: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:152:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:278:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::single_pass_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:278:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:278:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:281:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:281:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:191:13: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:191:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:321:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::forward_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:321:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:321:9: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:322:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:322:9: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:218:14: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:218:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:355:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::bidirectional_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:355:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:355:9: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:356:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:356:9: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:239:14: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:239:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:373:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::random_access_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:373:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:373:9: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/algorithm/sort.hpp:32:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:374:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:374:9: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/algorithm/sort.hpp:32:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessRangeConcept >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/algorithm/sort.hpp:32:5: required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&) [with RandomAccessRange = std::vector]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:172:21: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/functions.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/iterator_range_core.hpp:38, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/iterator_range.hpp:13, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/irange.hpp:16, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/detail/adjacency_list.hpp:21, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/adjacency_list.hpp:255, from RBGL.hpp:38, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:370:12: note: in a call to non-static member function ‘boost::RandomAccessRangeConcept >::~RandomAccessRangeConcept()’ 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::SinglePassRangeConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/algorithm/equal.hpp:174:13: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SinglePassRangeConcept >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/algorithm/equal.hpp:174:13: required from ‘bool boost::range::equal(const SinglePassRange1&, const SinglePassRange2&) [with SinglePassRange1 = std::vector; SinglePassRange2 = std::vector]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:178:27: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = const std::vector]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::safe_iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_safe_iterator_property_map(RAIter, std::size_t, ID) [with RAIter = __gnu_cxx::__normal_iterator >; ID = boost::vec_adj_list_vertex_id_map; typename std::iterator_traits< >::reference = int&; typename std::iterator_traits< >::value_type = int; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:214:54: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:278:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:278:9: required from ‘struct boost::SinglePassRangeConcept > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:281:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:281:9: required from ‘struct boost::SinglePassRangeConcept > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:321:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:321:9: required from ‘struct boost::ForwardRangeConcept > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:322:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:322:9: required from ‘struct boost::ForwardRangeConcept > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:355:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:355:9: required from ‘struct boost::BidirectionalRangeConcept > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:356:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:356:9: required from ‘struct boost::BidirectionalRangeConcept > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:373:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:373:9: required from ‘struct boost::RandomAccessRangeConcept > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/algorithm/sort.hpp:32:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:374:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:374:9: required from ‘struct boost::RandomAccessRangeConcept > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessRangeConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/algorithm/sort.hpp:32:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessRangeConcept > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/algorithm/sort.hpp:32:5: required from ‘RandomAccessRange& boost::range::sort(RandomAccessRange&, BinaryPredicate) [with RandomAccessRange = std::vector >; BinaryPredicate = boost::detail::isomorphism_algo, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::edge_cmp]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:226:17: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/range/size_type.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/size.hpp:21, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/functions.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/iterator_range_core.hpp:38, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/iterator_range.hpp:13, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/irange.hpp:16, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/detail/adjacency_list.hpp:21, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/adjacency_list.hpp:255, from RBGL.hpp:38, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:370:12: note: in a call to non-static member function ‘boost::RandomAccessRangeConcept > >::~RandomAccessRangeConcept()’ 370 | struct RandomAccessRangeConcept : BidirectionalRangeConcept | ^~~~~~~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; DFSVisitor = boost::detail::odd_components_counter; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = boost::edmonds_augmenting_path_finder; InitialMatchingFinder = boost::extra_greedy_matching; MatchingVerifier = boost::maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.3-3.17/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; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:12, from planar.cpp:3: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::odd_components_counter; Graph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >]’ 39 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int>, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:251:27: required from ‘boost::boyer_myrvold_impl::boyer_myrvold_impl(const Graph&, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; StoreOldHandlesPolicy = boost::graph::detail::no_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]’ /home/omnipath/local/R/4.3-3.17/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::property, boost::no_property, boost::listS> > >, std::integral_constant > >; mpl_::true_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.17/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::property, boost::no_property, boost::listS> > >, std::integral_constant > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:223:68: required from ‘bool boost::boyer_myrvold_planarity_test(const A0&) [with A0 = boost::adjacency_list, boost::property >]’ planar.cpp:121:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::planar_dfs_visitor >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int>; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DFSVisitorConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int>, boost::adjacency_list, boost::property > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int>, boost::adjacency_list, boost::property > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int>, boost::adjacency_list, boost::property > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int>, boost::adjacency_list, boost::property > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:130:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int>, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:251:27: required from ‘boost::boyer_myrvold_impl::boyer_myrvold_impl(const Graph&, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; StoreOldHandlesPolicy = boost::graph::detail::no_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]’ /home/omnipath/local/R/4.3-3.17/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::property, boost::no_property, boost::listS> > >, std::integral_constant > >; mpl_::true_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.17/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::property, boost::no_property, boost::listS> > >, std::integral_constant > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:223:68: required from ‘bool boost::boyer_myrvold_planarity_test(const A0&) [with A0 = boost::adjacency_list, boost::property >]’ planar.cpp:121:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property > >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list, boost::property >; DFSVisitor = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = boost::adjacency_list, boost::property >; DFSVisitor = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property > >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list, boost::property >; DFSVisitor = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = boost::adjacency_list, boost::property >; DFSVisitor = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:338:43: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = long unsigned int; Y = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::incrementable_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::single_pass_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = std::vector]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::forward_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::bidirectional_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::random_access_traversal_tag; Y = boost::iterators::random_access_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::SinglePassRangeConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = const std::vector]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’: /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::detail::isomorphism_algo, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::detail::isomorphism_algo, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order, boost::adjacency_list >]’: /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::detail::isomorphism_algo, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::detail::isomorphism_algo, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:12, from planar.cpp:3: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::isomorphism_algo, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order; Graph = boost::adjacency_list]’ 39 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::detail::isomorphism_algo, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::detail::isomorphism_algo, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:209:38: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:318:12: required from ‘struct boost::ForwardRangeConcept > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:352:12: required from ‘struct boost::BidirectionalRangeConcept > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:370:12: required from ‘struct boost::RandomAccessRangeConcept > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = std::vector >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:181:16: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:197:13: required from ‘struct boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::ForwardIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::ForwardIteratorConcept::~ForwardIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:197:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 197 | BOOST_CONCEPT_USAGE(ForwardIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:224:14: required from ‘struct boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::BidirectionalIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::BidirectionalIteratorConcept::~BidirectionalIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:224:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 224 | BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:245:14: required from ‘struct boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::RandomAccessIteratorConcept::~RandomAccessIteratorConcept() [with Iterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:245:14: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 245 | BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::iterators::incrementable_traversal_tag> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, boost::iterators::incrementable_traversal_tag>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, boost::iterators::incrementable_traversal_tag>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::iterators::incrementable_traversal_tag> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::iterators::incrementable_traversal_tag> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::iterators::incrementable_traversal_tag>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/iterator/iterator_concepts.hpp:114:7: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, boost::iterators::incrementable_traversal_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, boost::iterators::incrementable_traversal_tag>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/iterator/iterator_concepts.hpp:114:7: required from ‘struct boost::range_detail::IncrementableIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = boost::iterators::incrementable_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::iterators::single_pass_traversal_tag> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, boost::iterators::single_pass_traversal_tag>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, boost::iterators::single_pass_traversal_tag>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::iterators::single_pass_traversal_tag> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::iterators::single_pass_traversal_tag> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::iterators::single_pass_traversal_tag>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:152:13: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, boost::iterators::single_pass_traversal_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, boost::iterators::single_pass_traversal_tag>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:152:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:278:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = boost::iterators::single_pass_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:278:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:278:9: required from ‘struct boost::SinglePassRangeConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::SinglePassRangeConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/algorithm/equal.hpp:174:13: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::SinglePassRangeConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/algorithm/equal.hpp:174:13: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SinglePassRangeConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/algorithm/equal.hpp:174:13: required from ‘typename boost::range_difference::type boost::range::count_if(const SinglePassRange&, UnaryPredicate) [with SinglePassRange = std::pair, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >; UnaryPredicate = boost::indirect_pmap >, boost::vec_adj_list_vertex_id_map, char, char&> >; typename boost::range_difference::type = long int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:304:51: required from ‘bool boost::detail::isomorphism_algo::match(boost::detail::isomorphism_algo::edge_iter, int) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; boost::detail::isomorphism_algo::edge_iter = std::vector >::iterator]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:229:26: required from ‘bool boost::detail::isomorphism_algo::test_isomorphism() [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:532:33: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = const std::pair, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = boost::edmonds_augmenting_path_finder; InitialMatchingFinder = boost::extra_greedy_matching; MatchingVerifier = boost::maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.3-3.17/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; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::odd_components_counter; Graph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DFSVisitorConcept, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:130:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = boost::edmonds_augmenting_path_finder; InitialMatchingFinder = boost::extra_greedy_matching; MatchingVerifier = boost::maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.3-3.17/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; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = boost::edmonds_augmenting_path_finder; InitialMatchingFinder = boost::extra_greedy_matching; MatchingVerifier = boost::maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.3-3.17/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; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = boost::edmonds_augmenting_path_finder; InitialMatchingFinder = boost::extra_greedy_matching; MatchingVerifier = boost::maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.3-3.17/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; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’: /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; DFSVisitor = boost::detail::odd_components_counter; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; DFSVisitor = boost::detail::odd_components_counter; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = boost::edmonds_augmenting_path_finder; InitialMatchingFinder = boost::extra_greedy_matching; MatchingVerifier = boost::maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.3-3.17/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; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; DFSVisitor = boost::detail::odd_components_counter; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; DFSVisitor = boost::detail::odd_components_counter; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = boost::edmonds_augmenting_path_finder; InitialMatchingFinder = boost::extra_greedy_matching; MatchingVerifier = boost::maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.3-3.17/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; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int>, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:251:27: required from ‘boost::boyer_myrvold_impl::boyer_myrvold_impl(const Graph&, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; StoreOldHandlesPolicy = boost::graph::detail::no_old_handles; StoreEmbeddingPolicy = boost::graph::detail::no_embedding]’ /home/omnipath/local/R/4.3-3.17/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::property, boost::no_property, boost::listS> > >, std::integral_constant > >; mpl_::true_ = mpl_::bool_]’ /home/omnipath/local/R/4.3-3.17/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::property, boost::no_property, boost::listS> > >, std::integral_constant > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:223:68: required from ‘bool boost::boyer_myrvold_planarity_test(const A0&) [with A0 = boost::adjacency_list, boost::property >]’ planar.cpp:121:48: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::planar_dfs_visitor >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector > >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, long unsigned int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:494:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:495:5: required from ‘bool boost::isomorphism(const Graph1&, const Graph2&, IsoMapping, Invariant1, Invariant2, std::size_t, IndexMap1, IndexMap2) [with Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list; IsoMapping = boost::shared_array_property_map >; Invariant1 = boost::degree_vertex_invariant >, boost::adjacency_list >; Invariant2 = boost::degree_vertex_invariant >, boost::adjacency_list >; IndexMap1 = boost::vec_adj_list_vertex_id_map; IndexMap2 = boost::vec_adj_list_vertex_id_map; std::size_t = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::isomorphism_algo, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order; Graph = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DFSVisitorConcept, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order, boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order, boost::adjacency_list > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order, boost::adjacency_list > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order, boost::adjacency_list >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:130:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order>::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:125:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, boost::iterators::incrementable_traversal_tag>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::iterators::incrementable_traversal_tag> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, boost::iterators::incrementable_traversal_tag>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, boost::iterators::incrementable_traversal_tag>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::iterators::incrementable_traversal_tag> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::iterators::incrementable_traversal_tag> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = boost::iterators::incrementable_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:136:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept::~IncrementableIteratorConcept() [with Iterator = boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:136:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 136 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:147:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, boost::iterators::single_pass_traversal_tag>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::iterators::single_pass_traversal_tag> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, boost::iterators::single_pass_traversal_tag>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, boost::iterators::single_pass_traversal_tag>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::iterators::single_pass_traversal_tag> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::iterators::single_pass_traversal_tag> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = boost::iterators::single_pass_traversal_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:158:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::range_detail::SinglePassIteratorConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept::~SinglePassIteratorConcept() [with Iterator = boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:158:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 158 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::SinglePassRangeConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:284:9: required from ‘struct boost::SinglePassRangeConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::SinglePassRangeConcept, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept::~SinglePassRangeConcept() [with T = const std::pair, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, boost::adjacency_iterator, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/range/concepts.hpp:284:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 284 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = boost::edmonds_augmenting_path_finder; InitialMatchingFinder = boost::extra_greedy_matching; MatchingVerifier = boost::maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.3-3.17/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; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::odd_components_counter]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = boost::edmonds_augmenting_path_finder; InitialMatchingFinder = boost::extra_greedy_matching; MatchingVerifier = boost::maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.3-3.17/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; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = boost::edmonds_augmenting_path_finder; InitialMatchingFinder = boost::extra_greedy_matching; MatchingVerifier = boost::maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.3-3.17/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; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = boost::edmonds_augmenting_path_finder; InitialMatchingFinder = boost::extra_greedy_matching; MatchingVerifier = boost::maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.3-3.17/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; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = boost::edmonds_augmenting_path_finder; InitialMatchingFinder = boost::extra_greedy_matching; MatchingVerifier = boost::maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.3-3.17/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; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:129:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, boost::adjacency_list, boost::property > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = boost::adjacency_list, boost::property >; DFSVisitor = boost::detail::biconnected_components_visitor >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:211:27: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/planar_detail/boyer_myrvold_impl.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/boyer_myrvold_planar_test.hpp:12, from planar.cpp:3: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::biconnected_components_visitor >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >; Graph = boost::adjacency_list, boost::property >]’ 39 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::detail::isomorphism_algo, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::detail::isomorphism_algo, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:209:38: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::isomorphism_algo, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = boost::edmonds_augmenting_path_finder; InitialMatchingFinder = boost::extra_greedy_matching; MatchingVerifier = boost::maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.3-3.17/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; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; DFSVisitor = boost::detail::odd_components_counter; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; DFSVisitor = boost::detail::odd_components_counter; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = boost::edmonds_augmenting_path_finder; InitialMatchingFinder = boost::extra_greedy_matching; MatchingVerifier = boost::maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.3-3.17/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; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::biconnected_components_visitor >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DFSVisitorConcept >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, boost::adjacency_list, boost::property > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, boost::adjacency_list, boost::property > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, boost::adjacency_list, boost::property > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >, boost::adjacency_list, boost::property > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:130:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter >, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = boost::edmonds_augmenting_path_finder; InitialMatchingFinder = boost::extra_greedy_matching; MatchingVerifier = boost::maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.3-3.17/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; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair boost::detail::bicomp_dispatch2::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair boost::detail::bicomp_dispatch1::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const boost::bgl_named_params&) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >; P = int; T = boost::buffer_param_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>; OutputIterator = std::back_insert_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_biconnected_planar.hpp:44:27: required from ‘void boost::make_biconnected_planar(Graph&, PlanarEmbedding, EdgeIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; PlanarEmbedding = std::vector >*; EdgeIndexMap = boost::adj_list_edge_property_map, boost::edge_index_t>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:213:35: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::biconnected_components_visitor >, boost::adj_list_edge_property_map, boost::edge_index_t>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator >, std::stack, std::deque, std::allocator > > >, std::vector, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::dfs_visitor<> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::detail::isomorphism_algo, boost::adjacency_list, boost::shared_array_property_map >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::degree_vertex_invariant >, boost::adjacency_list >, boost::vec_adj_list_vertex_id_map, boost::vec_adj_list_vertex_id_map >::record_dfs_order; ColorMap = boost::safe_iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = boost::edmonds_augmenting_path_finder; InitialMatchingFinder = boost::extra_greedy_matching; MatchingVerifier = boost::maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.3-3.17/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; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = boost::edmonds_augmenting_path_finder; InitialMatchingFinder = boost::extra_greedy_matching; MatchingVerifier = boost::maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.3-3.17/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; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = boost::edmonds_augmenting_path_finder; InitialMatchingFinder = boost::extra_greedy_matching; MatchingVerifier = boost::maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.3-3.17/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; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; DFSVisitor = boost::detail::odd_components_counter; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = boost::edmonds_augmenting_path_finder; InitialMatchingFinder = boost::extra_greedy_matching; MatchingVerifier = boost::maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.3-3.17/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; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from planar.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list, boost::property >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list, boost::property >; P = boost::detail::components_recorder >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> >; T = boost::graph_visitor_t; R = boost::no_property; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&> > >, boost::parameter::aux::empty_arg_list, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = boost::adjacency_list, boost::property >; ComponentMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::undir_adj_list_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/make_connected.hpp:38:51: required from ‘void boost::make_connected(Graph&, VertexIndexMap, AddEdgeVisitor&) [with Graph = boost::adjacency_list, boost::property >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AddEdgeVisitor = my_add_edge_visitor, boost::property >, long unsigned int>]’ planar.cpp:211:26: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:651:42: required from ‘bool boost::graph::detail::isomorphism_impl::operator()(const Graph1&, const Graph2&, const ArgPack&) const [with ArgPack = boost::parameter::aux::empty_arg_list; Graph1 = boost::adjacency_list; Graph2 = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:662:5: required from ‘typename boost::result_of(Param0, Param1, const ArgPack&)>::type boost::graph::isomorphism_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; ArgPack = boost::parameter::aux::empty_arg_list; typename boost::result_of(Param0, Param1, const ArgPack&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/isomorphism.hpp:666:1: required from ‘typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type boost::isomorphism(const Param0&, const Param1&) [with Param0 = boost::adjacency_list; Param1 = boost::adjacency_list; typename boost::result_of(Param0, Param1, const boost::parameter::aux::empty_arg_list&)>::type = bool]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:278:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator, VertexIndexMap) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/is_kuratowski_subgraph.hpp:290:34: required from ‘bool boost::is_kuratowski_subgraph(const Graph&, ForwardIterator, ForwardIterator) [with Graph = boost::adjacency_list, boost::property >; ForwardIterator = __gnu_cxx::__normal_iterator*, std::vector > >]’ planar.cpp:435:37: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = boost::edmonds_augmenting_path_finder; InitialMatchingFinder = boost::extra_greedy_matching; MatchingVerifier = boost::maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.3-3.17/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; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = boost::edmonds_augmenting_path_finder; InitialMatchingFinder = boost::extra_greedy_matching; MatchingVerifier = boost::maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.3-3.17/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; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > >; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::bgl_named_params, boost::graph_visitor_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/max_cardinality_matching.hpp:779:27: required from ‘static bool boost::maximum_cardinality_matching_verifier::verify_matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/max_cardinality_matching.hpp:807:79: required from ‘bool boost::matching(const Graph&, MateMap, VertexIndexMap) [with Graph = R_adjacency_list; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; AugmentingPathFinder = boost::edmonds_augmenting_path_finder; InitialMatchingFinder = boost::extra_greedy_matching; MatchingVerifier = boost::maximum_cardinality_matching_verifier]’ /home/omnipath/local/R/4.3-3.17/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; MateMap = long unsigned int*; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; MateMap = long unsigned int*]’ planar.cpp:686:60: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> >, boost::filtered_graph, boost::keep_all, boost::maximum_cardinality_matching_verifier, long unsigned int*, boost::vec_adj_list_vertex_id_map, long unsigned int> >::non_odd_vertex >, boost::vec_adj_list_vertex_id_map, long unsigned int>, int, int&> > > >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/opt/R-devel/lib/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.17/BH/include' -I/usr/local/include -fpic -g -O2 -c registerSigHandlers.cpp -o registerSigHandlers.o In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from registerSigHandlers.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from registerSigHandlers.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from registerSigHandlers.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:250:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 250 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from registerSigHandlers.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from registerSigHandlers.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:507:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 507 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from registerSigHandlers.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from registerSigHandlers.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:520:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 520 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from registerSigHandlers.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from registerSigHandlers.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:603:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 603 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from registerSigHandlers.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from registerSigHandlers.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:612:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 612 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from registerSigHandlers.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from registerSigHandlers.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:614:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 614 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from registerSigHandlers.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38, from registerSigHandlers.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/scoped_ptr.hpp:74:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 74 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from registerSigHandlers.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ g++ -std=gnu++17 -I"/opt/R-devel/lib/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.17/BH/include' -I/usr/local/include -fpic -g -O2 -c shortestPath.cpp -o shortestPath.o In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from shortestPath.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:250:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 250 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from shortestPath.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:507:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 507 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from shortestPath.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:520:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 520 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from shortestPath.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:603:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 603 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from shortestPath.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:612:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 612 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from shortestPath.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:614:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 614 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from shortestPath.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/scoped_ptr.hpp:74:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 74 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from shortestPath.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, double> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:516:5: required from ‘struct boost::concepts::BasicMatrix, long unsigned int, double>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:514:1: required from ‘struct boost::concepts::BasicMatrixConcept, long unsigned int, double>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::BasicMatrixConcept, long unsigned int, double>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, double> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, double> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int, double>)>’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::BasicMatrix, long unsigned int, double>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BasicMatrixConcept, long unsigned int, double>]’: /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:514:15: note: in a call to non-static member function ‘boost::concepts::BasicMatrixConcept, long unsigned int, double>::~BasicMatrixConcept()’ 514 | BOOST_concept(BasicMatrix, (M)(I)(V)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:514:1: note: in expansion of macro ‘BOOST_concept’ 514 | BOOST_concept(BasicMatrix, (M)(I)(V)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’: /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept >::~VertexListGraphConcept()’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro ‘BOOST_concept’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’: /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept >::~EdgeListGraphConcept()’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’: /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::BasicMatrix, long unsigned int, double>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, double> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:516:5: required from ‘struct boost::concepts::BasicMatrix, long unsigned int, double>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:514:1: required from ‘struct boost::concepts::BasicMatrixConcept, long unsigned int, double>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::BasicMatrixConcept, long unsigned int, double>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, double> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, double> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int, double>)>’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::BasicMatrix::~BasicMatrix() [with M = Basic2DMatrix; I = long unsigned int; V = double]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:516:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 516 | BOOST_CONCEPT_USAGE(BasicMatrix) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’: /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >::~EdgeListGraphConcept()’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.17/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&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.17/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&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’: /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.17/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&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept > >::~EdgeListGraphConcept()’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept]’: /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.17/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&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = double*; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.17/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&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:120:43: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 182 | BOOST_CONCEPT_USAGE(VertexListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EdgeListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EdgeListGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept >, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::edge_weight_t>, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::edge_weight_t>, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.17/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&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.17/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&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EdgeListGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = double*; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.17/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&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = double*; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = double*; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.17/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&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = double*; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:545:11: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:573:11: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::WritablePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.17/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&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.17/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&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept > >, R_adjacency_list >]’: /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:16, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:13, from shortestPath.cpp:5: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::topo_sort_visitor > >; Graph = R_adjacency_list]’ 39 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::ColorValueConcept]’: /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:15: note: in a call to non-static member function ‘boost::concepts::ColorValueConcept::~ColorValueConcept()’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: note: in expansion of macro ‘BOOST_concept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = double; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.17/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&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:39:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::topo_sort_visitor > >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DFSVisitorConcept > >, R_adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, R_adjacency_list > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, R_adjacency_list > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept > > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::ColorValue::~ColorValue() [with C = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:505:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 505 | BOOST_CONCEPT_USAGE(ColorValue) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.17/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&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.17/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&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.17/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&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.17/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&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:42:22: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, PredecessorMap, DijkstraVisitor, Compare, Combine, DistInf, DistZero) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; PredecessorMap = long unsigned int*; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:90:27: required from ‘void boost::detail::dag_sp_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, boost::default_color_type, boost::default_color_type&>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:114:25: required from ‘void boost::detail::dag_sp_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, ColorMap, IndexMap, DijkstraVisitor, const Params&) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; ColorMap = boost::param_not_found; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dag_shortest_paths.hpp:134:29: required from ‘void boost::dag_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:144:27: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::topo_sort_visitor > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less >, R_adjacency_list >]’: /home/omnipath/local/R/4.3-3.17/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; Buffer = boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >; BFSVisitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less >; ColorMap = boost::two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/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; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/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 boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = char; Tag = boost::detail::unused_tag_type; Base = boost::no_property; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:21, from shortestPath.cpp:3: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less >; Graph = R_adjacency_list]’ 37 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/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; Buffer = boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >; BFSVisitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less >; ColorMap = boost::two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/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; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/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 boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = char; Tag = boost::detail::unused_tag_type; Base = boost::no_property; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph, boost::property >, boost::no_property, boost::listS> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >]’: /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Buffer = boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >; BFSVisitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >; ColorMap = boost::two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/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 boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; T = char; Tag = boost::detail::unused_tag_type; Base = boost::no_property; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’: /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Buffer = boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >; BFSVisitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >; ColorMap = boost::two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/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 boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; T = char; Tag = boost::detail::unused_tag_type; Base = boost::no_property; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:21, from shortestPath.cpp:3: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ 37 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Buffer = boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >; BFSVisitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >; ColorMap = boost::two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/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 boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; T = char; Tag = boost::detail::unused_tag_type; Base = boost::no_property; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.17/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&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.17/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&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; PredecessorMap = long unsigned int*; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.17/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&) [with EdgeListGraph = boost::adjacency_list >; Size = int; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; DistanceMap = double*; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:201:36: required from ‘bool boost::bellman_ford_shortest_paths(EdgeListGraph&, Size, const boost::bgl_named_params&) [with EdgeListGraph = boost::adjacency_list >; Size = int; P = double*; T = boost::vertex_distance_t; R = boost::bgl_named_params, boost::edge_weight_t>, boost::edge_weight_t, boost::no_property> >]’ shortestPath.cpp:105:45: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:39:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::BFSVisitorConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less >, R_adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less >, R_adjacency_list > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less >, R_adjacency_list > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less >, R_adjacency_list >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:65:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph, boost::property >, boost::no_property, boost::listS> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:39:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::BFSVisitorConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:65:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; Zero = double]’ /home/omnipath/local/R/4.3-3.17/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&) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; P = int; T = int; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:186:48: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = long unsigned int*; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:245:46: required from ‘static boost::detail::vertex_property_map_generator_helper::type boost::detail::vertex_property_map_generator_helper::build(const Graph&, const IndexMap&, boost::scoped_array&) [with Graph = R_adjacency_list; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Value = long unsigned int; boost::detail::vertex_property_map_generator_helper::type = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:273:33: required from ‘static boost::detail::vertex_property_map_generator::type boost::detail::vertex_property_map_generator::build(const Graph&, const IndexMap&, boost::scoped_array&) [with Graph = R_adjacency_list; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Value = long unsigned int; boost::detail::vertex_property_map_generator::type = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>]’ /home/omnipath/local/R/4.3-3.17/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; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less, std::vector >, boost::adj_list_edge_property_map, boost::edge_weight_t>, long unsigned int*, double*, std::plus, std::less >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::WritablePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Buffer = boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >; BFSVisitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >; ColorMap = boost::two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = std::plus; DistInf = double; DistZero = double; T = double*; Tag = boost::vertex_distance_t; Base = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list; DistanceMap = double*; WeightMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Params = boost::bgl_named_params >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with VertexListGraph = R_adjacency_list; Param = double*; Tag = boost::vertex_distance_t; Rest = boost::bgl_named_params; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ shortestPath.cpp:25:32: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Buffer = boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >; BFSVisitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >; ColorMap = boost::two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from shortestPath.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ shortestPath.cpp:56:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/opt/R-devel/lib/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.17/BH/include' -I/usr/local/include -fpic -g -O2 -c sna.cpp -o sna.o In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from sna.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:250:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 250 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from sna.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:507:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 507 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from sna.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:520:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 520 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from sna.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:603:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 603 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from sna.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:612:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 612 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from sna.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:614:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 614 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from sna.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/scoped_ptr.hpp:74:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 74 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from sna.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, double> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:516:5: required from ‘struct boost::concepts::BasicMatrix, long unsigned int, double>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:514:1: required from ‘struct boost::concepts::BasicMatrixConcept, long unsigned int, double>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::BasicMatrixConcept, long unsigned int, double>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, double> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, double> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int, double>)>’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::BasicMatrix, long unsigned int, double>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::BasicMatrixConcept, long unsigned int, double>]’: /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:514:15: note: in a call to non-static member function ‘boost::concepts::BasicMatrixConcept, long unsigned int, double>::~BasicMatrixConcept()’ 514 | BOOST_concept(BasicMatrix, (M)(I)(V)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:514:1: note: in expansion of macro ‘BOOST_concept’ 514 | BOOST_concept(BasicMatrix, (M)(I)(V)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::BasicMatrix, long unsigned int, double>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int, double> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:516:5: required from ‘struct boost::concepts::BasicMatrix, long unsigned int, double>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:514:1: required from ‘struct boost::concepts::BasicMatrixConcept, long unsigned int, double>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::BasicMatrixConcept, long unsigned int, double>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int, double> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int, double> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int, double>)>’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::BasicMatrix::~BasicMatrix() [with M = Basic2DMatrix; I = long unsigned int; V = double]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:516:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 516 | BOOST_CONCEPT_USAGE(BasicMatrix) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’: /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >::~EdgeListGraphConcept()’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’: /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/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, std::allocator > > > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EdgeListGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept >, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::edge_weight_t>, boost::detail::edge_desc_impl > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::edge_weight_t>, boost::detail::edge_desc_impl > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::WritablePropertyMapConcept, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = boost::default_color_type; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:545:11: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:573:11: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Value = boost::detail::edge_desc_impl; ID = boost::vec_adj_list_vertex_id_map]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:21, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:29, from sna.cpp:3: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; Graph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph, boost::property >, boost::no_property, boost::listS> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >]’: /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Buffer = boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >; BFSVisitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >; ColorMap = boost::two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/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 boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; T = char; Tag = boost::detail::unused_tag_type; Base = boost::no_property; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::BFSVisitorConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’: /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Buffer = boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >; BFSVisitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >; ColorMap = boost::two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/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 boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; T = char; Tag = boost::detail::unused_tag_type; Base = boost::no_property; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:21, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/johnson_all_pairs_shortest.hpp:29, from sna.cpp:3: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ 37 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Buffer = boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >; BFSVisitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >; ColorMap = boost::two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/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 boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; T = char; Tag = boost::detail::unused_tag_type; Base = boost::no_property; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:40:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; Graph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::BFSVisitorConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:65:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph, boost::property >, boost::no_property, boost::listS> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property >, boost::no_property, boost::listS> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property >, boost::no_property, boost::listS> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/bellman_ford_shortest_paths.hpp:40:9: required from ‘void boost::BFSVisitorConcept::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >; Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::BFSVisitorConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >, boost::adjacency_list, boost::property >, boost::no_property, boost::listS> >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:65:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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 RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; SourceIterator = long unsigned int*; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Size = long unsigned int; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight_t>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; BinaryFunction = boost::closed_plus; BinaryPredicate = std::less; BellmanFordVisitor = boost::bellman_visitor<>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::forward_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map >::value_type, typename std::iterator_traits< >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = long unsigned int*; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>; typename std::iterator_traits< >::reference = long unsigned int&; typename std::iterator_traits< >::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:245:46: required from ‘static boost::detail::vertex_property_map_generator_helper::type boost::detail::vertex_property_map_generator_helper::build(const Graph&, const IndexMap&, boost::scoped_array&) [with Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Value = long unsigned int; boost::detail::vertex_property_map_generator_helper::type = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:273:33: required from ‘static boost::detail::vertex_property_map_generator::type boost::detail::vertex_property_map_generator::build(const Graph&, const IndexMap&, boost::scoped_array&) [with Graph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Value = long unsigned int; boost::detail::vertex_property_map_generator::type = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Buffer = boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >; BFSVisitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >; ColorMap = boost::two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistZero = double; ColorMap = boost::two_bit_color_map, long unsigned int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::two_bit_color_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::WritablePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility/base_from_member.hpp:15, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/utility.hpp:15, from RBGL.hpp:16, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = long unsigned int*]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>; Buffer = boost::queue > >; BFSVisitor = boost::bfs_visitor*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>, boost::on_tree_edge> >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/breadth_first_search.hpp:136:24: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept, boost::property >, boost::no_property, boost::listS> >]’ /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; Buffer = boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >; BFSVisitor = boost::detail::dijkstra_bfs_visitor, boost::d_ary_heap_indirect, long unsigned int>, long unsigned int, long unsigned int&>, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, std::less, std::vector > >, boost::adj_list_edge_property_map >, boost::edge_weight2_t>, boost::dummy_property_map, boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>, boost::closed_plus, std::less >; ColorMap = boost::two_bit_color_map, long unsigned int> >; SourceIterator = long unsigned int*]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > > > >*, std::vector > > > >, std::allocator > > > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::filtered_graph > > > >, boost::is_residual_edge > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from RBGL.hpp:17, from sna.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = boost::adjacency_list > > > >; CapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; ResidualCapacityEdgeMap = boost::adj_list_edge_property_map > > >, boost::edge_residual_capacity_t>; ReverseEdgeMap = boost::adj_list_edge_property_map, const boost::detail::edge_desc_impl&, long unsigned int, const boost::property > > >, boost::edge_reverse_t>; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, boost::default_color_type, boost::default_color_type&>; PredEdgeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; typename boost::property_traits::value_type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:154:41: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch2::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, PredMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, boost::vec_adj_list_vertex_id_map, boost::detail::edge_desc_impl, boost::detail::edge_desc_impl&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value::type boost::detail::edmonds_karp_dispatch1::apply(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&, boost::param_not_found) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor, const boost::bgl_named_params&) [with Graph = boost::adjacency_list > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value::type = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits::vertex_descriptor, typename boost::graph_traits::vertex_descriptor) [with Graph = boost::adjacency_list > > > >; typename boost::property_traits::const_type>::value_type = double; typename boost::property_map::const_type = boost::adj_list_edge_property_map > > >, boost::edge_capacity_t>; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ sna.cpp:204:54: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/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 = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; SourceInputIter = long unsigned int*; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/dijkstra_shortest_paths.hpp:505:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename boost::graph_traits::vertex_descriptor, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = boost::adjacency_list, boost::property >, boost::no_property, boost::listS>; DijkstraVisitor = boost::dijkstra_visitor<>; PredecessorMap = boost::dummy_property_map; DistanceMap = boost::vec_adj_list_vertex_property_map, boost::property >, boost::no_property, boost::listS>, boost::adjacency_list, boost::property >, boost::no_property, boost::listS>*, double, double&, boost::vertex_distance_t>; WeightMap = boost::adj_list_edge_property_map >, boost::edge_weight2_t>; IndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Compare = std::less; Combine = boost::closed_plus; DistInf = double; DistZero = double; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; BinaryPredicate = std::less; BinaryFunction = boost::closed_plus; Infinity = double; DistanceZero = double]’ /home/omnipath/local/R/4.3-3.17/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&, Weight, VertexID) [with VertexAndEdgeListGraph = R_adjacency_list; DistanceMatrix = Basic2DMatrix; P = int; T = int; R = boost::no_property; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>; VertexID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/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; DistanceMatrix = Basic2DMatrix]’ sna.cpp:105:41: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/opt/R-devel/lib/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.17/BH/include' -I/usr/local/include -fpic -g -O2 -c transitive_closure.cpp -o transitive_closure.o In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/bind/mem_fn.hpp:25, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/bind/bind.hpp:26, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:16, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/get_pointer.hpp:48:40: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 48 | template T * get_pointer(std::auto_ptr const& p) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/config/no_tr1/memory.hpp:21, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/get_pointer.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/bind/mem_fn.hpp:25, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/bind/bind.hpp:26, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:16, from transitive_closure.cpp:16: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/config/no_tr1/memory.hpp:21, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/get_pointer.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/bind/mem_fn.hpp:25, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/bind/bind.hpp:26, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:16, from transitive_closure.cpp:16: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:250:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 250 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/config/no_tr1/memory.hpp:21, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/get_pointer.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/bind/mem_fn.hpp:25, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/bind/bind.hpp:26, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:16, from transitive_closure.cpp:16: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:507:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 507 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/config/no_tr1/memory.hpp:21, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/get_pointer.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/bind/mem_fn.hpp:25, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/bind/bind.hpp:26, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:16, from transitive_closure.cpp:16: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:520:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 520 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/config/no_tr1/memory.hpp:21, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/get_pointer.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/bind/mem_fn.hpp:25, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/bind/bind.hpp:26, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:16, from transitive_closure.cpp:16: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:603:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 603 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/config/no_tr1/memory.hpp:21, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/get_pointer.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/bind/mem_fn.hpp:25, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/bind/bind.hpp:26, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:16, from transitive_closure.cpp:16: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:612:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 612 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/config/no_tr1/memory.hpp:21, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/get_pointer.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/bind/mem_fn.hpp:25, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/bind/bind.hpp:26, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:16, from transitive_closure.cpp:16: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:614:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 614 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/config/no_tr1/memory.hpp:21, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/get_pointer.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/bind/mem_fn.hpp:25, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/bind/bind.hpp:26, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:16, from transitive_closure.cpp:16: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/adjacency_list.hpp:22, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:21, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/scoped_ptr.hpp:74:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 74 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/config/no_tr1/memory.hpp:21, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/get_pointer.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/bind/mem_fn.hpp:25, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/bind/bind.hpp:26, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:16, from transitive_closure.cpp:16: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’: /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/int.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/lambda_fwd.hpp:23, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/aux_/na_spec.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/if.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_traits.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept >::~VertexListGraphConcept()’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro ‘BOOST_concept’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:157:5: required from ‘struct boost::concepts::AdjacencyGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘struct boost::concepts::AdjacencyGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::AdjacencyGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’: /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/int.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/lambda_fwd.hpp:23, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/aux_/na_spec.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/if.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_traits.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:152:15: note: in a call to non-static member function ‘boost::concepts::AdjacencyGraphConcept >::~AdjacencyGraphConcept()’ 152 | BOOST_concept(AdjacencyGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:152:1: note: in expansion of macro ‘BOOST_concept’ 152 | BOOST_concept(AdjacencyGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:295:5: required from ‘struct boost::concepts::VertexMutableGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:292:1: required from ‘struct boost::concepts::VertexMutableGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexMutableGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexMutableGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexMutableGraphConcept >]’: /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/int.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/lambda_fwd.hpp:23, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/aux_/na_spec.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/if.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_traits.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:292:15: note: in a call to non-static member function ‘boost::concepts::VertexMutableGraphConcept >::~VertexMutableGraphConcept()’ 292 | BOOST_concept(VertexMutableGraph, (G)) | ^~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:292:1: note: in expansion of macro ‘BOOST_concept’ 292 | BOOST_concept(VertexMutableGraph, (G)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:279:5: required from ‘struct boost::concepts::EdgeMutableGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:275:1: required from ‘struct boost::concepts::EdgeMutableGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeMutableGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeMutableGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeMutableGraphConcept >]’: /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/int.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/lambda_fwd.hpp:23, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/aux_/na_spec.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/if.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_traits.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:275:15: note: in a call to non-static member function ‘boost::concepts::EdgeMutableGraphConcept >::~EdgeMutableGraphConcept()’ 275 | BOOST_concept(EdgeMutableGraph, (G)) | ^~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:275:1: note: in expansion of macro ‘BOOST_concept’ 275 | BOOST_concept(EdgeMutableGraph, (G)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 182 | BOOST_CONCEPT_USAGE(VertexListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::AdjacencyGraph >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:157:5: required from ‘struct boost::concepts::AdjacencyGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘struct boost::concepts::AdjacencyGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:157:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 157 | BOOST_CONCEPT_USAGE(AdjacencyGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexMutableGraph >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:295:5: required from ‘struct boost::concepts::VertexMutableGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:292:1: required from ‘struct boost::concepts::VertexMutableGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::VertexMutableGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexMutableGraph::~VertexMutableGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:295:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 295 | BOOST_CONCEPT_USAGE(VertexMutableGraph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeMutableGraph >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:279:5: required from ‘struct boost::concepts::EdgeMutableGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:275:1: required from ‘struct boost::concepts::EdgeMutableGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::EdgeMutableGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeMutableGraph::~EdgeMutableGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:279:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 279 | BOOST_CONCEPT_USAGE(EdgeMutableGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::vec_adj_list_vertex_id_map, long unsigned int>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, long unsigned int>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/int.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/lambda_fwd.hpp:23, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/aux_/na_spec.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/if.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_traits.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::adjacency_iterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:160:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:160:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::adjacency_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::readable_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::adjacency_iterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:160:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::adjacency_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::adjacency_iterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::adjacency_iterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/int.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/lambda_fwd.hpp:23, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/aux_/na_spec.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/if.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_traits.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::adjacency_iterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::adjacency_iterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::adjacency_iterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept > >, boost::adjacency_list >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::topo_sort_visitor > >; Graph = boost::adjacency_list]’ 39 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::adjacency_iterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::adjacency_iterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:603:11: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator >; Value = long unsigned int; ID = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:115:9: required from ‘typename boost::property_traits::value_type boost::detail::strong_components_impl(const Graph&, ComponentMap, RootMap, DiscoverTime, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DiscoverTime = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:162:42: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch2::apply(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, DiscoverTimeMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘typename boost::property_traits::value_type boost::detail::strong_components_impl(const Graph&, ComponentMap, RootMap, DiscoverTime, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DiscoverTime = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:162:42: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch2::apply(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, DiscoverTimeMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:119:9: required from ‘typename boost::property_traits::value_type boost::detail::strong_components_impl(const Graph&, ComponentMap, RootMap, DiscoverTime, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DiscoverTime = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:162:42: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch2::apply(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params&, DiscoverTimeMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/int.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/lambda_fwd.hpp:23, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/aux_/na_spec.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/if.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_traits.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::topo_sort_visitor > >; Graph = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DFSVisitorConcept > >, boost::adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::adjacency_list > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::adjacency_list > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::adjacency_list >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:130:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/int.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/lambda_fwd.hpp:23, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/aux_/na_spec.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/if.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_traits.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept > > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’: /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/int.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/lambda_fwd.hpp:23, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/aux_/na_spec.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/if.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_traits.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::ColorValueConcept]’: /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/int.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/lambda_fwd.hpp:23, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/aux_/na_spec.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/if.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_traits.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:15: note: in a call to non-static member function ‘boost::concepts::ColorValueConcept::~ColorValueConcept()’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: note: in expansion of macro ‘BOOST_concept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator, boost::property, boost::no_property, boost::listS>, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:159:9: required from ‘boost::concepts::AdjacencyGraph::~AdjacencyGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:152:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::AdjacencyGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:545:11: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:573:11: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:115:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:115:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:115:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/int.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/lambda_fwd.hpp:23, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/aux_/na_spec.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/if.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_traits.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = long unsigned int; Y = long unsigned int]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::topo_sort_visitor > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::ColorValue::~ColorValue() [with C = boost::default_color_type]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:505:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 505 | BOOST_CONCEPT_USAGE(ColorValue) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:206:43: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/int.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/lambda_fwd.hpp:23, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/aux_/na_spec.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/if.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_traits.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::WritablePropertyMapConcept, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/int.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/lambda_fwd.hpp:23, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/aux_/na_spec.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/if.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_traits.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ConvertibleConcept]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DefaultConstructible >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::EqualityComparable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Assignable >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::Convertible]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >, R_adjacency_list >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, long unsigned int>, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:129:27: required from ‘typename boost::property_traits::value_type boost::detail::strong_components_impl(const Graph&, ComponentMap, RootMap, DiscoverTime, const boost::bgl_named_params&) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; DiscoverTime = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:162:42: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; Graph = R_adjacency_list]’ 39 | void constraints() | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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 /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::DFSVisitorConcept, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >, R_adjacency_list >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >, R_adjacency_list > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >, R_adjacency_list > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >, R_adjacency_list >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:130:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/int.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/lambda_fwd.hpp:23, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/aux_/na_spec.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/if.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_traits.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’: /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::detail::tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, long unsigned int>, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:129:27: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/int.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/lambda_fwd.hpp:23, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/aux_/na_spec.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/mpl/if.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_traits.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::detail::tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = R_adjacency_list; ArgPack = boost::parameter::aux::arg_list, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = R_adjacency_list; P = boost::detail::tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, long unsigned int>, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:129:27: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const boost::bgl_named_params&) [with Param0 = boost::adjacency_list; P = boost::topo_sort_visitor > >; T = boost::graph_visitor_t; R = boost::bgl_named_params, boost::vertex_index_t, boost::no_property>; typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename boost::detail::convert_bgl_params_to_boost_parameter >::type = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const boost::bgl_named_params&) [with VertexListGraph = boost::adjacency_list; OutputIterator = std::back_insert_iterator >; P = boost::typed_identity_property_map; T = boost::vertex_index_t; R = boost::no_property]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::CopyConstructibleConcept, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept, long unsigned int> >, long unsigned int>]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept, long unsigned int> >, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, long unsigned int> >, long unsigned int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, long unsigned int> >, long unsigned int>)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:134:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map, long unsigned int> >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::detail::tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename boost::graph_traits::vertex_descriptor) [with VertexListGraph = R_adjacency_list; DFSVisitor = boost::detail::tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; ColorMap = boost::shared_array_property_map, long unsigned int> >; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > > >, boost::parameter::aux::arg_list, long unsigned int> >, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:406:5: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/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( | ^~~~~~~~~~~~~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/assert.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:19, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = R_adjacency_list]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept >]’ /home/omnipath/local/R/4.3-3.17/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::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list; DFSVisitor = boost::detail::tarjan_scc_visitor, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int>, long unsigned int, long unsigned int&>, std::stack > > >; ColorMap = boost::shared_array_property_map, long unsigned int> >; TerminatorFunc = boost::detail::nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:286:39: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/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/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:31, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:20, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/graph_concepts.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/depth_first_search.hpp:18, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:17, from transitive_closure.cpp:16: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, boost::concepts::detail::wrap_constraints*) [with Model = boost::InputIterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits::value_type boost::detail::strong_comp_dispatch1::apply(const Graph&, ComponentMap, const boost::bgl_named_params&, boost::param_not_found) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params&, RootMap) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; RootMap = boost::param_not_found; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits::value_type boost::strong_components(const Graph&, ComponentMap, const boost::bgl_named_params&, typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type) [with Graph = R_adjacency_list; ComponentMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; P = boost::vec_adj_list_vertex_id_map, long unsigned int>; T = boost::vertex_index_t; R = boost::no_property; typename boost::property_traits::value_type = long unsigned int; typename boost::enable_if_c::traversal_category>::value, boost::graph::detail::no_parameter>::type = boost::graph::detail::no_parameter; typename boost::graph_traits::traversal_category = boost::adj_list_dir_traversal_tag]’ /home/omnipath/local/R/4.3-3.17/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; GraphTC = R_adjacency_list; G_to_TC_VertexMap = boost::iterator_property_map, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map, long unsigned int>]’ /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/transitive_closure.hpp:288:23: required from ‘void boost::transitive_closure(const Graph&, GraphTC&) [with Graph = R_adjacency_list; GraphTC = R_adjacency_list]’ transitive_closure.cpp:29:24: required from here /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/omnipath/local/R/4.3-3.17/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ g++ -std=gnu++17 -I"/opt/R-devel/lib/R/include" -DNDEBUG -I'/home/omnipath/local/R/4.3-3.17/BH/include' -I/usr/local/include -fpic -g -O2 -c wavefront.cpp -o wavefront.o In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from wavefront.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 361 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from wavefront.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from wavefront.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:250:65: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 250 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R > | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from wavefront.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from wavefront.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:507:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 507 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from wavefront.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from wavefront.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:520:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 520 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from wavefront.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from wavefront.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:603:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 603 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from wavefront.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from wavefront.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:612:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 612 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from wavefront.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from wavefront.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:614:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 614 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from wavefront.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ In file included from /home/omnipath/local/R/4.3-3.17/BH/include/boost/scoped_ptr.hpp:13, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/graph/adjacency_list.hpp:22, from RBGL.hpp:38, from wavefront.cpp:1: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope: /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/scoped_ptr.hpp:74:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 74 | explicit scoped_ptr( std::auto_ptr p ) BOOST_SP_NOEXCEPT : px( p.release() ) | ^~~~~~~~ In file included from /usr/include/c++/11/memory:76, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/detail/shared_count.hpp:27, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/omnipath/local/R/4.3-3.17/BH/include/boost/property_map/property_map.hpp:598, from RBGL.hpp:17, from wavefront.cpp:1: /usr/include/c++/11/bits/unique_ptr.h:57:28: note: declared here 57 | template class auto_ptr; | ^~~~~~~~ g++ -std=gnu++17 -shared -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 installing to /home/omnipath/local/R/4.3-3.17/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) * installing *source* package ‘RUnit’ ... ** package ‘RUnit’ successfully unpacked and MD5 sums checked ** using staged installation ** R ** 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 ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (RUnit) * installing *source* package ‘stringdist’ ... ** package ‘stringdist’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C compiler: ‘gcc (Ubuntu 11.3.0-1ubuntu1~22.04) 11.3.0’ gcc -I"/opt/R-devel/lib/R/include" -DNDEBUG -I../inst/include -I/usr/local/include -fopenmp -fpic -g -O2 -c R_register_native.c -o R_register_native.o gcc -I"/opt/R-devel/lib/R/include" -DNDEBUG -I../inst/include -I/usr/local/include -fopenmp -fpic -g -O2 -c Rstringdist.c -o Rstringdist.o gcc -I"/opt/R-devel/lib/R/include" -DNDEBUG -I../inst/include -I/usr/local/include -fopenmp -fpic -g -O2 -c dl.c -o dl.o gcc -I"/opt/R-devel/lib/R/include" -DNDEBUG -I../inst/include -I/usr/local/include -fopenmp -fpic -g -O2 -c hamming.c -o hamming.o gcc -I"/opt/R-devel/lib/R/include" -DNDEBUG -I../inst/include -I/usr/local/include -fopenmp -fpic -g -O2 -c jaro.c -o jaro.o gcc -I"/opt/R-devel/lib/R/include" -DNDEBUG -I../inst/include -I/usr/local/include -fopenmp -fpic -g -O2 -c lcs.c -o lcs.o gcc -I"/opt/R-devel/lib/R/include" -DNDEBUG -I../inst/include -I/usr/local/include -fopenmp -fpic -g -O2 -c lv.c -o lv.o gcc -I"/opt/R-devel/lib/R/include" -DNDEBUG -I../inst/include -I/usr/local/include -fopenmp -fpic -g -O2 -c osa.c -o osa.o gcc -I"/opt/R-devel/lib/R/include" -DNDEBUG -I../inst/include -I/usr/local/include -fopenmp -fpic -g -O2 -c qgram.c -o qgram.o gcc -I"/opt/R-devel/lib/R/include" -DNDEBUG -I../inst/include -I/usr/local/include -fopenmp -fpic -g -O2 -c soundex.c -o soundex.o gcc -I"/opt/R-devel/lib/R/include" -DNDEBUG -I../inst/include -I/usr/local/include -fopenmp -fpic -g -O2 -c stringdist.c -o stringdist.o gcc -I"/opt/R-devel/lib/R/include" -DNDEBUG -I../inst/include -I/usr/local/include -fopenmp -fpic -g -O2 -c utf8ToInt.c -o utf8ToInt.o gcc -I"/opt/R-devel/lib/R/include" -DNDEBUG -I../inst/include -I/usr/local/include -fopenmp -fpic -g -O2 -c utils.c -o utils.o gcc -shared -L/usr/local/lib -o stringdist.so R_register_native.o Rstringdist.o dl.o hamming.o jaro.o lcs.o lv.o osa.o qgram.o soundex.o stringdist.o utf8ToInt.o utils.o -fopenmp installing to /home/omnipath/local/R/4.3-3.17/00LOCK-stringdist/00new/stringdist/libs ** R ** 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 (stringdist) * installing *source* package ‘biocViews’ ... ** using staged installation ** 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 ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (biocViews) * installing *source* package ‘BiocCheck’ ... ** using staged installation ** R ** 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 ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (BiocCheck) The downloaded source packages are in ‘/tmp/Rtmpt7n5GW/downloaded_packages’ Skipping 3 packages ahead of CRAN: commonmark, gtable, htmlwidgets [ Finished: 2023-03-17 23:33:31 CET ]